The NEOS Server offers BARON for the solution of mixed integer nonlinearly constrained optimization
problems in AMPL format.
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 of 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 is developed by Nick Sahinidis.
Using the NEOS Server for BARON
The user must submit a model in AMPL
format to solve an optimization problem. The examples section of the AMPL website provides
examples of models in AMPL format.
The problem must be specified by a model file with the options of a data
file and a commands file. If the commands file is specified, it must contain
the AMPL solve command. However, the commands file must not contain
the model or data commands. The model and data files are renamed internally by NEOS.
The commands file may include option settings for BARON. To specify solver
option baron_options 'OPTIONS';
where OPTIONS is a list of one or more of the BARON options,
which are listed at BARON Options for AMPL.