> 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
Changing Problem Type in MIPs
Using the Mixed Integer Optimizer
Using the MIP Solution
Using Special Ordered Sets
Using Semi-Continuous Variables
Progress Reports: Interpreting the Node Log
Troubleshooting MIP Performance Problems
Example: Optimizing a Basic MIP Problem
Example: Reading a MIP Problem from a File
Example: Using SOS and Priority

PREVIOUS NEXT