Before the solver actually crunches the numbers, a "pre-solve" phase reduces the size of the problem by removing redundant constraints and fixing variables. Version 12.10 enhanced the pre-solve capability to identify more complex reductions, effectively shrinking the search space the algorithm must traverse.
Solves problems with linear objective functions and linear constraints. Mixed-Integer Programming (MIP): ibm cplex 12.10
: It remains the only commercial solver with a fully automatic Benders decomposition algorithm , which was further optimized in this version for partial set-covering problems. Before the solver actually crunches the numbers, a