|
BARON is a solver that is designed to find globally optimal solutions for nonconvex optimization model types. Baron was developed by N. Sahinidis, M. Tawarmalani and associates at the University of Illinois-Urbana-Champaign. Purely continuous, purely integer, and mixed-integer nonlinear model types can be solved. The BARON acronym stands for the branch and reduce optimization navigator. It derives its name from its combining of constraint propagation, interval analysis, and duality approaches in a problem reduction arsenal along with enhanced branch and bound concepts. BARON uses these procedures to searching for global solutions in the face of the non convex hills and valleys a problem structure may exhibit.
BARON encompasses:
| • | A general purpose solver for optimization problems with nonlinear constraints and/or integer variables. |
| • | Fast specialized solvers for linearly constrained problems. |
| • | Capability to solve LP, MIP, RMIP, NLP, DNLP, RMINLP, and MINLP model types. |
The GAMS solver manual for BARON is baron.pdf and a more general manual is on http://archimedes.scs.uiuc.edu/baron/manuse.pdf and a more general discussion of the whole area appears on http://www.gamsworld.org/global/index.htm.
|