A note on solving MINLP’s using formulation space search (with C.O. Lopez) Optimization Letters vol.8, no.3, 2014, pp1167-1182

In this note we present an approach based on formulation space search to solve mixed-integer nonlinear (zero-one) programming problems. Our approach is an iterative one which adds a single nonlinear inequality constraint of increasing tightness to the original problem. Computational results are presented for our approach on 51 standard benchmark problems taken from MINLPLib. We compare our approach against the Minotaur and minlp_bb nonlinear solvers, as well as against the RECIPE algorithms.

Keywords: Mixed-integer nonlinear (zero-one) programming, formulation space search

Full paper

J E Beasley