The following is a simple mixed integer programming problem. Details can be found in Example 3.8 in the "Examples" section.

Example 3.8: A Simple Integer Program Recall the linear programming problem presented in the "Introduction to Mathematical Programming" chapter. In that problem, a firm produces two products, ...

The branch-and-bound method with the revised dual simplex for bounded variables is very effective in solving relatively large-size integer linear programming problems. This paper, based on the general ...

A new integer programming dual problem is constructed from a reformulation of the integer programming problem. Properties of this integer programming dual problem are developed and it is shown that ...