Advertisement

Integer Programming

  • Robert J. Vanderbei
Part of the International Series in Operations Research & Management Science book series (ISOR, volume 114)

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.

Keywords

Schedule Problem Programming Problem Integer Programming Linear Programming Problem Feasible Region 
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.

References

  1. Garfinkel, R. & Nemhauser, G. (1972), Integer Programming, John Wiley and Sons, New York.MATHGoogle Scholar
  2. Nemhauser, G. & Wolsey, L. (1988), Integer and Combinatorial Optimization, Wiley, New York.MATHGoogle Scholar

Copyright information

© Robert J.Vanderbei 2008

Authors and Affiliations

  • Robert J. Vanderbei
    • 1
  1. 1.Dept. of Operations Research and Financial EngineeringPrinceton UniversityNew JerseyUSA

Personalised recommendations