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.
KeywordsSetup Time Simplex Method Integral Solution Side Condition Dual Simplex Method
Unable to display preview. Download preview PDF.