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 13 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.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
Notes
Standard references for integer programming include the classic text by Garfinkel & Nemhauser (1972) and the more recent text by Nemhauser & Wolsey (1988).
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2001 Robert J. Vanderbei
About this chapter
Cite this chapter
Vanderbei, R.J. (2001). Integer Programming. In: Linear Programming. International Series in Operations Research & Management Science, vol 37. Springer, Boston, MA. https://doi.org/10.1007/978-1-4757-5662-3_22
Download citation
DOI: https://doi.org/10.1007/978-1-4757-5662-3_22
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4757-5664-7
Online ISBN: 978-1-4757-5662-3
eBook Packages: Springer Book Archive