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

Bonmin is an experimental open-source C++ code for solving general
mixed-integer nonlinearly constrained problems. Bonmin features several
algorithms

B-BB is a NLP-based branch-and-bound algorithm,

B-OA is an outer-approximation decomposition algorithm,

B-QG is an implementation of Quesada and Grossmann's branch-and-cut algorithm,

B-Hyb is a hybrid outer-approximation based branch-and-cut algorithm.

The algorithms in Bonmin are exact when the objective and constraint functions are
convex; in the case the functions are non-convex, they are heuristics.

Bonmin is a hybrid between two classical algorithms for mixed-integer
nonlinear programming: an outer-approximation-based branch-and-cut-based
algorithm and a pure branch-and-bound algorithm. The user can set options
to declare which version of the algorithm should be employed through NEOS.

Bonmin was developed by a large team of researchers at IBM and Carnegie
Mellon:

Pierre Bonami

Lorenz Biegler

Andrew Conn

Gerard Cornuejols

Ignacio Grossmann

Carl Laird

Jon Lee

Andrea Lodi

Francois Margot

Nicolas Sawaya

Andreas Wächter

Information about Bonmin can be found on the Bonmin homepage on
the COIN-OR 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

Enter the location of the AMPL data file (local file)

Commands File

Enter the location of the AMPL commands file (local file)

Options File

Enter the location of the Bonmin options file (local file)

Comments

Additional Settings

Dry run: generate job XML instead of submitting it to NEOS
Short Priority: submit to higher priority queue with maximum CPU time
of 5 minutes
E-Mail address:

Auto-Fill

Please do not click the 'Submit to NEOS' button more than once.