BARON
From DDL Wiki
(Difference between revisions)
Current revision (13:06, 29 November 2007) (view source) |
|||
| Line 5: | Line 5: | ||
*[http://www.gams.com/solvers/solvers.htm#BARON GAMS/BARON solver page] | *[http://www.gams.com/solvers/solvers.htm#BARON GAMS/BARON solver page] | ||
*[http://www-neos.mcs.anl.gov/neos/solvers/go:BARON/GAMS.html BARON in NEOS server] | *[http://www-neos.mcs.anl.gov/neos/solvers/go:BARON/GAMS.html BARON in NEOS server] | ||
| + | |||
| + | [[category:software]] | ||
| + | [[category:optimization]] | ||
| + | [[category:MINLP]] | ||
Current revision
BARON (Branch And Reduce Optimization Navigator) is a computational system developed by BARON is being developed by Prof. Nick Sahinidis and Prof. Mohit Tawarmalani. It is capable to solve nonconvex optimization problems with purely continuous, purely integer, and mixed-integer variables (MINLP) to global optimality with. BARON combines constraint propagation, interval analysis, and duality for efficient range reduction while rigorous relaxations are constructed by enlarging the feasible region and/or underestimating the objective function.
