BARON
| Developer(s) | The Optimization Firm |
|---|---|
| Written in | Fortran, C, C++, YACC |
| Type | Mathematical Optimization, Operations Research |
| License | Proprietary |
| Website | minlp |
BARON is a computational system for solving non-convex optimization problems to global optimality. Purely continuous, purely integer, and mixed-integer nonlinear problems can be solved by the solver. Linear programming (LP), nonlinear programming (NLP), mixed integer programming (MIP), and mixed integer nonlinear programming (MINLP) are supported. In a comparison of different solvers, BARON solved the most benchmark problems and required the least amount of time per problem.[1]
BARON is available under the AIMMS, AMPL, GAMS, JuMP, MATLAB, Pyomo, and YALMIP modeling environments on a variety of platforms. The GAMS/BARON solver is also available on the NEOS Server.[2]
The development of the BARON algorithms and software has been recognized by the 2004 INFORMS Computing Society Prize[3] and the 2006 Beale-Orchard-Hays Prize[4] for excellence in computational mathematical programming from the Mathematical Optimization Society.
References[edit]
- ^ "A comparison of complete global optimization solvers" (PDF). Archived from the original (PDF) on 2005-05-06. Retrieved 2022-09-21.
- ^ "BARON on the NEOS Server". Archived from the original on 2013-06-29. Retrieved 2016-01-26.
- ^ "ICS Prize / Prizes / ICS / Community / IOL Home - INFORMS.org". October 20, 2010. Archived from the original on 2010-10-20.
- ^ "Mathematical Optimization Society". May 21, 2011. Archived from the original on 2011-05-21.
External links[edit]