The problems in this chapter are classical examples of integer programs (IP). A better name would be discrete linear programs because we described the past ones as continuous linear programs and the antonym of continuous is discrete. Alas, the tradition is firmly entrenched so we will refer to them as IPs. They are characterized by algebraically linear constraints and linear objectives with the additional requirement that variables must take on only integral values.
All are very simple to state, if not always simple to model or solve. ...
