AN ALGORITHM FOR THE MIXED INTEGER PROBLEM

Abstract

An algorithm is given for the numerical solution of the 'mixed integer' linear programming problem, the problem of maximizing a linear form in finitely many variables constrained both by linear inequalities and the requirement that a proper subset of the variables assume only integral values. The algorithm is an extension of the cutting plane technique for the solution of the 'pure integer' problem.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jun 23, 1960
Accession Number
AD0616505

Entities

People

  • Ralph Gomory

Organizations

  • RAND Corporation

Tags

Communities of Interest

  • Air Platforms

DTIC Thesaurus Topics

  • Abstracts
  • Algorithms
  • Coefficients
  • Computer Programming
  • Corporations
  • Equations
  • Heuristic Methods
  • Inequalities
  • Integrals
  • Linear Programming
  • Mathematics
  • Simplex Method

Fields of Study

  • Mathematics

Readers

  • Operations Research