Originally posted by: SystemAdmin
[jgregory said:]
The CPLEX User's Manual is intended to give insights into how the branch and cut algorithm works, from the perspective of helping users understand the ways to control various aspects of that algorithm. Have a look in the Discrete Optimization chapter, in particular the section titled "Tuning performance features of the mixed integer optimizer".
The only nonlinearity that CPLEX explicitly supports is convex quadratic, either in the objective function or in constraints or both. Apart from the algorithms that handle the continuous subproblems (LP, QP, or QCP), the way that the mixed-integer problem is solved is more or less unaffected when quadratics are involved.
Because CPLEX is a proprietary commercial product, publication in academic journals is not a primary goal. Howver several years ago, the team published a paper that I like to recommend, ââ¬ÅMIP: Theory and practice -- closing the gap". You can find a copy at
http://www.ilog.com/products/optimization/tech/research/mip.pdf . The principles found there still apply.
Other papers about ILOG products, including CPLEX, may be found listed at
http://www.ilog.com/products/optimization/info/randlit.cfm .
#CPLEXOptimizers#DecisionOptimization