Advertisement

Integer Linear Programming

  • Sven Danø

Abstract

In some linear programming problems it is required of the optimal solution that the variables, or some of them, should be non-negative integers (0, 1, 2, ...), the interpretation of the problem being such that fractional values would be meaningless or irrelevant. For example, a commodity may be produced only in multiples of one ton, or it has to be shipped in large indivisible units. Problems of this type are dealt with by integer (or discrete) linear programming.

Keywords

Setup Time Simplex Method Integral Solution Side Condition Dual Simplex Method 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag/Wien 1974

Authors and Affiliations

  • Sven Danø
    • 1
  1. 1.University of CopenhagenDenmark

Personalised recommendations