E-mail this pageBaron Solver Information
BARON (Branch-And-Reduce Optimization Navigator) is a computational system for solving nonconvex optimization problems to global optimality. Purely continuous, purely integer, and mixed-integer nonlinear problems can be solved with the software. The Branch And Reduce Optimization Navigator derives its name from its combining constraint propagation, interval analysis, and duality in its reduce arsenal with enhanced branch and bound concepts as it winds its way through the hills and valleys of complex optimization problems in search of global solutions.
As of the release of AIMMS 3.6, BARON 7.5 is available. This combination does no longer require an additional extension with CPLEX, MINOS and/or SNOPT, but allow one to use BARON directly in combination with the default solver XA and CONOPT available in every AIMMS system. BARON 7.5 can also be used to find the k-best solutions. BARON 7.5 can also handle MIP problems.
BARON Usage
BARON guarantees to provide global optima under fairly general assumptions, but cannot handle constraints that contain goniometric functions or with a reference to an external function. BARON requires that all nonlinear variables and expressions in the mathematical program are bounded from below and above. If the user provides finite lower and upper bounds on all variables, models up to 2,000 variables and constraints can be solved.
Website: http://archimedes.scs.uiuc.edu/baron.html
Version(s):
- AIMMS 3.6-3.8 supports BARON 7.5. Also available in free trial license of AIMMS.
- AIMMS 3.5 supports BARON 7.2*.
*) AIMMS 3.5 offers BARON 7.2 and requires an extension of the AIMMS license with CPLEX & MINOS or SNOPT. Although BARON can also be used in combination with CPLEX only, we recommend to combine it with one of the NLP solvers MINOS or SNOPT.
Credits: Parts of the BARON Software were created at the University of Illinois at Urbana-Champaign
