ILOG CPLEX Mixed Integer Optimizer employs state-of-the-art algorithms and techniques to provide fast, robust solutions for the most difficult mixed integer programming problems (MIPs). ILOG CPLEX incorporates the latest breakthroughs in mixed integer programming research, as well as ILOG's own innovations in its flexible, high-performance mixed integer optimizer.

Full control for a wide range of prgrams
ILOG CPLEX Mixed Integer Optimizer can solve mixed integer linear programs (MILP), mixed integer quadratic programs (MIQP) and mixed integer quadratically constrained programs (MIQCP). It includes the ILOG CPLEX presolve algorithm, sophisticated cutting-plane strategies and feasibility heuristics. Users can direct the optimizer to return multiple solutions to a program.

ILOG CPLEX Mixed Integer Optimizer implements default settings and parameter selections that work well for many programs, but users also may customize the search strategy or select specialized techniques that take advantage of structures in their specific programs. For example, you can customize the branching process and the node and variable selection strategies, or control the frequency and type of feasibility heuristics applied to find integer-feasible solutions. You can tell ILOG CPLEX whether it is more important to find an optimal solution or a quick, but good, feasible solution; in response, the ILOG CPLEX Mixed Integer Optimizer will automatically adjust its strategy to fit your goal.

Features of the mixed integer algorithm

• Multiple types of cutting planes
• Clique cuts
• Cover cuts
• Disjunctive cuts
• Flow cover cuts
• Flow path cuts
• Gomory fractional cuts
• GUB cover cuts
• Implied bound cuts
• Mixed integer rounding (MIR) cuts
• Zero half cuts
• User choices for emphasizing optimality or feasibility
• Special ordered sets (SOS)
• Heuristics
• Integrated and automatic mixed-integer problem reduction algorithms with preprocessing and postprocessing
• Breadth-first, best-first or depth-first search
• User-defined branching priorities and directions
• User-determined node selection algorithms
• User-determined variable selection options
• Multiple LP algorithm options for nodes and initial relaxation
• Cut-off and shortcut techniques
• Customized branching strategies
• User-defined memory controls, allowing disk storage to be efficiently used as secondary memory
• Probing
• Available in ILOG Parallel CPLEX