Every mixed integer programming problem is shown to be equivalent to an infinite number of other mixed integer programming problems. The optimal solution to any problem in a class determines the ...

Formulations of mathematical programs often require that some of the decision variables take only integer values. Consider the formulation You can follow the same steps to identify binary variables.

Methods for NP-hard discrete optimization problems, including general methods like branch-and-bound and cutting planes, as well as special purpose branch-and-cut methods. Students will be able to ...