ILOG CPLEX Simplex Optimizers are fast, robust implementations of the dual simplex and primal simplex methods for linear and quadratic programming. ILOG CPLEX Simplex Optimizers also provide a lightning-fast implementation of the network simplex method. Specially suited for pure network problems, the network simplex method can even solve problems that have side constraints.

All ILOG CPLEX algorithms are tightly integrated with cutting-edge presolve algorithms. These algorithms reduce problem size and provide significant reductions in solve times, without requiring any special user intervention. Each optimizer has numerous options that enable performance to be tuned for specific problems.

Features of the ILOG CPLEX Simplex algorithm:

Multiple crash basis options
• Primal and dual steepest-edge algorithms
• IIS finder for detecting problem infeasibilities
• Sophisticated degeneracy resolution
• Efficient restarts from existing bases or solutions
• Integrated and automatic problem-reduction algorithms with preprocessing and postprocessing

Features of ILOG CPLEX Network Optimizer:

• Natural node/arc network representation
• Automatic network extraction
• Multiple pricing algorithms
• Efficient restarts from advanced network bases