ILOG CPLEX 11.0 User's Manual > Discrete Optimization > Solving Mixed Integer Programming Problems (MIP)

Solving Mixed Integer Programming Problems (MIP)

The ILOG CPLEX Mixed Integer Optimizer enables you to solve models in which one or more variables must take integer solution values. This chapter tells you more about optimizing mixed integer programming (MIP) problems with ILOG CPLEX. It includes information about:

Stating a MIP Problem
Considering Preliminary Issues
Using the Mixed Integer Optimizer
Tuning Performance Features of the Mixed Integer Optimizer
Using the MIP Solution
Progress Reports: Interpreting the Node Log
Troubleshooting MIP Performance Problems
Examples: Optimizing a Simple MIP Problem
Example: Reading a MIP Problem from a File

PREVIOUS NEXT