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 with the software. BARON is available under the AIMMS, AMPL, and GAMS modeling languages on a variety of platforms. The GAMS/BARON solver is also available on the NEOS Server.[1]
The development of the BARON algorithms and software has been recognized by the 2004 INFORMS Computing Society Prize[2] and the 2006 Beale-Orchard-Hays Prize[3] for excellence in computational mathematical programming from the Mathematical Optimization Society.
References
""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". web.archive.org. October 20, 2010.
"Mathematical Optimization Society". web.archive.org. May 21, 2011.
External links
GAMS/BARON manual
Nick Sahinidis's Homepage
Mohit Tawarmalani's Homepage
Undergraduate Texts in Mathematics
Graduate Studies in Mathematics
Hellenica World - Scientific Library
Retrieved from "http://en.wikipedia.org/"
All text is available under the terms of the GNU Free Documentation License
