BARON Global Optimization Software

BARON 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.

BARON provides:

  • A general purpose solver for optimization problems with nonlinear constraints and/or integer variables.
  • Fast specialized solvers for many linearly constrained problems.
  • Easy to use GAMS/AMPL-like interface to the general purpose and specialized solvers.
  • 100+ page manual.
  • A developer-oriented core component that facilitates the implementation of branch and bound algorithms.
  • Availability under the widely used AIMMS and GAMS modeling languages.

The code is developed and maintained by Nick Sahinidis's optimization group.   Former and current students have contributed in many different ways.   Special thanks are due to Mohit Tawarmalani.