The NEOS Server offers Bonmin (Basic Open-source
Nonlinear Mixed INteger programming) for the solution
of mixed-integer nonlinearly-constrained optimization problems. Bonmin is
also available open source under the Common Public License.
Problems for Bonmin can be submitted on the NEOS server in AMPL or GAMS
Bonmin is an experimental open-source C++ code for solving general
mixed-integer nonlinearly constrained problems. Bonmin features several
Bonmin was developed by a large team of researchers at IBM and Carnegie
The user must submit a model in AMPL
format. Examples are provided in the examples
section of the AMPL website.
The problem must be specified in a model file. A data file and commands
files may also be provided. If the commands file is specified, it must
contain the AMPL solve command; however, it 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 the solver. To specify
solver options, add
option bonmin_options 'OPTIONS';
Bonmin has a variety of options that can be set to alter the behavior of
the algorithm. The
Manual describes all the solver options available to
the user. There are two ways to set options for Bonmin:
option bonmin_options "OPTIONS";