Bonmin
An algorithmic framework for convex mixed integer nonlinear programs. 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.
Keywords for this software
References in zbMATH (referenced in 187 articles )
Showing results 1 to 20 of 187.
Sorted by year (- Liu, Yanchao: A note on solving DiDi’s driver-order matching problem (2021)
- Okuno, Takayuki; Ikebe, Yoshiko: A new approach for solving mixed integer DC programs using a continuous relaxation with no integrality gap and smoothing techniques (2021)
- Bernal, David E.; Vigerske, Stefan; Trespalacios, Francisco; Grossmann, Ignacio E.: Improving the performance of DICOPT in convex MINLP problems using a feasibility pump (2020)
- Coey, Chris; Lubin, Miles; Vielma, Juan Pablo: Outer approximation with conic certificates for mixed-integer convex problems (2020)
- De Santis, Marianna; Grani, Giorgio; Palagi, Laura: Branching with hyperplanes in the criterion space: the frontier partitioner algorithm for biobjective integer programming (2020)
- Fischetti, Matteo; Monaci, Michele: A branch-and-cut algorithm for mixed-integer bilinear programming (2020)
- Kirches, C.; Lenders, F.; Manns, P.: Approximation properties and tight bounds for constrained mixed-integer optimal control (2020)
- Kronqvist, Jan; Bernal, David E.; Grossmann, Ignacio E.: Using regularization and second order information in outer approximation for convex MINLP (2020)
- Leyffer, Sven; Vanaret, Charlie: An augmented Lagrangian filter method (2020)
- Mai, Tien; Lodi, Andrea: A multicut outer-approximation approach for competitive facility location under random utilities (2020)
- Melo, Wendel; Fampa, Marcia; Raupp, Fernanda: An overview of MINLP algorithms and their implementation in Muriqui optimizer (2020)
- Neumann, Christoph; Stein, Oliver; Sudermann-Merx, Nathan: Granularity in nonlinear mixed-integer optimization (2020)
- Andersson, Joel A. E.; Gillis, Joris; Horn, Greg; Rawlings, James B.; Diehl, Moritz: CasADi: a software framework for nonlinear optimization and optimal control (2019)
- Bei, Xiaoqiang; Zhu, Xiaoyan; Coit, David W.: A risk-averse stochastic program for integrated system design and preventive maintenance planning (2019)
- Benítez-Peña, Sandra; Blanquero, Rafael; Carrizosa, Emilio; Ramírez-Cobo, Pepa: On support vector machines under a multiple-cost scenario (2019)
- Berthold, Timo; Lodi, Andrea; Salvagnin, Domenico: Ten years of feasibility pump, and counting (2019)
- Buchheim, Christoph; Montenegro, Maribel; Wiegele, Angelika: SDP-based branch-and-bound for non-convex quadratic integer optimization (2019)
- Burlacu, Robert; Egger, Herbert; Groß, Martin; Martin, Alexander; Pfetsch, Marc E.; Schewe, Lars; Sirvent, Mathias; Skutella, Martin: Maximizing the storage capacity of gas networks: a global MINLP approach (2019)
- Cay, Pelin; Mancilla, Camilo; Storer, Robert H.; Zuluaga, Luis F.: Operational decisions for multi-period industrial gas pipeline networks under uncertainty (2019)
- D’Ambrosio, Claudia; Frangioni, Antonio; Gentile, Claudio: Strengthening the sequential convex MINLP technique by perspective reformulations (2019)