The NEOS Server offers BARON for 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 being developed by Nick Sahinidis and Mohit Tawarmalani.
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).
An option file can be used to specify BARON options. Currently, the NEOS Server can only use optfile=1 with GAMS input. Therefore, any model that specifies a different options file will not work as intended.
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.
You can submit an optimization problem specified in the GAMS modeling language to be solved using the optimization tools on the NEOS Server. You need to specify the absolute path to a GAMS file on your system. Model File:
<modelname>.optfile = 1 ;
optfile = 1
DOE disclaimer DOE Web privacy policy