BONMIN

BONMIN: Bonmin (Basic Open-source Nonlinear Mixed Integer programming) 0.9 is an open-source solver for mixedinteger nonlinear programming (MINLPs), whereof some parts are still experimental. The code is developed in a joint project of IBM and the Carnegie Mellon University. The COIN-OR project leader for Bonmin is Pierre Bonami.

Bonmin implements five different algorithms:

- B-BB: a simple branch-and-bound algorithm based on solving a continuous nonlinear program at each node of the search tree and branching on variables

- B-OA: an outer-approximation based decomposition algorithm

- B-QG: an outer-approximation based branch-and-cut algorithm (by Queseda and Grossmann)

- B-Hyb: a hybrid outer-approximation/nonlinear programming based branch-and-cut algorithm (default)

- B-Ecp: an ECP cuts based branch-and-cut algorithm a la FilMINT

The algorithms are exact when the problem is convex, otherwise they are heuristics.

An in core link exists and has the solver name BONMIND.

BONMIN was previously named COINBONMIN.