An Algorithmic Framework for Convex Mixed Integer Nonlinear Programs

Abstract : This paper is motivated by the fact that mixed integer nonlinear programming is an important and difficult area for which there is a need for developing new methods and software for solving large-scale problems. Moreover, both fundamental building blocks, namely mixed integer linear programming and nonlinear programming, have seen considerable and steady progress in recent years. Wishing to exploit expertise in these areas as well as on previous work in mixed integer nonlinear programming, this work represents the first step in an ongoing and ambitious project within an open-source environment. COIN-OR is our chosen environment for the development of the optimization software. A class of hybrid algorithms, of which branch-and-bound and polyhedral outer approximation are the two extreme cases, are proposed and implemented. Computational results that demonstrate the effectiveness of this framework are reported. Both the library of mixed integer nonlinear problems that exhibit convex continuous relaxations, on which the experiments are carried out, and a version of the software used are publicly available.
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-00421753
Contributor : Pierre Bonami <>
Submitted on : Saturday, October 3, 2009 - 12:18:14 PM
Last modification on : Friday, March 9, 2018 - 11:25:23 AM

Links full text

Identifiers

Collections

Citation

Pierre Bonami, Lorenz Biegler, Andrew Conn, Gérard Cornuéjols, Ignacio Grossmann, et al.. An Algorithmic Framework for Convex Mixed Integer Nonlinear Programs. Discrete Optimization, Elsevier, 2007, 5 (2), pp.186-204. ⟨10.1016/j.disopt.2006.10.011⟩. ⟨hal-00421753⟩

Share

Metrics

Record views

314