The NEOS Server offers
the solution of global optimization problems
in GAMS 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 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. The availability of BARON on the NEOS Server is possible
thanks to the generosity of the GAMS Development Corporation and the providers
of software for the solution of the LP and NLP subproblems solved by
BARON. CPLEX and MINOS are the default BARON solvers for LP and
NLP subproblems, respectively.
Using the NEOS Server for BARON
The user must submit a model in GAMS
format to solve a global optimization problem. For security purposes, the model
submitted must adhere to the following conventions:
If you are unfamiliar with GAMS, the
includes a GAMS Tutorial and User's Guide. Examples of models in GAMS
format can be found in the
GAMS Model Libraries.
- It must be self-contained, i.e., no $include or $batinclude statements.
- It must not execute external program, i.e., no $call or execute statements.
- It must not create files, i.e. no put files or $echo statements.
The NEOS Server initially limits the amount of output generated in the
listing file by turning off the symbol and unique element list, symbol
cross references, and restricting the rows and columns listed to zero.
This behavior can be changed by specifying the appropriate options
in the model file. See the
documentation on the
modeling language for further information.