Quantitative Analysis for Management, 13/e

10.1 Integer Programming

An integer programming model is a model that has constraints and an objective function identical to that formulated by LP. The only difference is that one or more of the decision variables has to take on an integer value in the final solution. There are three types of integer programming problems:

Solution values must be whole numbers in integer programming.

1. Pure integer programming problems are cases in which all variables are required to have integer values.

2. Mixed-integer programming problems are cases in which some, but not all, of the decision variables are required to have integer values.

3. Zero–one integer programming problems are special cases in which all the decision variables must have integer solution values ...