AN ALGORITHM FOR INTEGER LINEAR PROGRAMMING BY PARAMETRIC MODIFICATION OF AN ADDED CONSTRAINT

Abstract

To solve an integer linear program, we identify particular values that the objective function can assume on feasible lattice points. Thus, we reduce the problem of finding an optimal integer solution of n dimensions to that of finding a feasible integer solution of n-1 dimensions. A Branch and Bound Method is presented to solve the latter problem for the 0-1 case.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Aug 01, 1967
Accession Number
AD0660007

Entities

People

  • Hajime Eto

Organizations

  • University of California, Berkeley

Tags

Communities of Interest

  • Air Platforms

DTIC Thesaurus Topics

  • Abstracts
  • Algorithms
  • California
  • Coefficients
  • Computer Programming
  • Contracts
  • Evolutionary Algorithms
  • Governments
  • Heuristic Methods
  • Integer Programming
  • Integrals
  • Linear Programming
  • Military Research
  • Operations Research
  • Simplex Method
  • United States Government
  • Universities

Fields of Study

  • Mathematics

Readers

  • Operations Research