Integer programming uses a model similar to linear programming in that the objective function and constraint functions are linear. In integer programming, however, some or all the variables are required to be integer.

This teaching add-in illustrates three primary methods of solving integer programming problems, the branch and bound method, the cutting plane method and Benders' algorithm.