Mixed Integer Programming

This chapter extends the LP problem from Chapter 2 to a Mixed Integer Programming (MIP) problem. It describes how to

• transform a MIP model into matrix format,
• input MIP problems with different types of discrete variables into Xpress Optimizer,
• solve MIP problems and output the solution.

Chapter 6 shows how to formulate and solve this example with Mosel and in Chapter 11 the same is done with BCL.