Abstract
Many real-world problems could be modeled as linear programs except that some or all of the variables are constrained to be integers. Such problems are called integer programming problems. One might think that these problems wouldn’t be much harder than linear programming problems. For example, we saw in Chapter 14 that for network flow problems with integer data, the simplex method automatically produces integer solutions. But that was just luck. In general, one can’t expect to get integer solutions; in fact, as we shall see in this chapter, integer programming problems turn out to be generally much harder to crack than linear ones.
Preview
Unable to display preview. Download preview PDF.
References
Garfinkel, R. & Nemhauser, G. (1972), Integer Programming, John Wiley and Sons, New York.
Nemhauser, G. & Wolsey, L. (1988), Integer and Combinatorial Optimization, Wiley, New York.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2008 Robert J.Vanderbei
About this chapter
Cite this chapter
Vanderbei, R.J. (2008). Integer Programming. In: Linear Programming. International Series in Operations Research & Management Science, vol 114. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-74388-2_23
Download citation
DOI: https://doi.org/10.1007/978-0-387-74388-2_23
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-74387-5
Online ISBN: 978-0-387-74388-2
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)