Integer Programming with Mathematica
Volume 6, Issue 3
Micheal Bulmer and Michael Carter
Linear programming is the most widely used procedure in practical optimization.
In earlier articles in the Journal, we introduced the simplex method
for solving linear programming problems and provided some tools for sensitivity
analysis. In this article, we show how these tools can be extended to encompass
integer linear programming, when some or all of the decision variables
must be integers.
Electronic supplement packages: