## Article contents

# Mixed-integer nonlinear optimization*†

Published online by Cambridge University Press:
**02 April 2013**

## Abstract

Many optimal decision problems in scientific, engineering, and public sector applications involve both discrete decisions and nonlinear system dynamics that affect the quality of the final design or plan. These decision problems lead to mixed-integer nonlinear programming (MINLP) problems that combine the combinatorial difficulty of optimizing over discrete variable sets with the challenges of handling nonlinear functions. We review models and applications of MINLP, and survey the state of the art in methods for solving this challenging class of problems.

Most solution methods for MINLP apply some form of tree search. We distinguish two broad classes of methods: single-tree and multitree methods. We discuss these two classes of methods first in the case where the underlying problem functions are convex. Classical single-tree methods include nonlinear branch-and-bound and branch-and-cut methods, while classical multitree methods include outer approximation and Benders decomposition. The most efficient class of methods for convex MINLP are hybrid methods that combine the strengths of both classes of classical techniques.

Non-convex MINLPs pose additional challenges, because they contain non-convex functions in the objective function or the constraints; hence even when the integer variables are relaxed to be continuous, the feasible region is generally non-convex, resulting in many local minima. We discuss a range of approaches for tackling this challenging class of problems, including piecewise linear approximations, generic strategies for obtaining convex relaxations for non-convex functions, spatial branch-and-bound methods, and a small sample of techniques that exploit particular types of non-convex structures to obtain improved convex relaxations.

We finish our survey with a brief discussion of three important aspects of MINLP. First, we review heuristic techniques that can obtain good feasible solution in situations where the search-tree has grown too large or we require real-time solutions. Second, we describe an emerging area of mixed-integer optimal control that adds systems of ordinary differential equations to MINLP. Third, we survey the state of the art in software for MINLP.

- Type
- Research Article
- Information
- Copyright
- Copyright © Cambridge University Press 2013

## Footnotes

Colour online for monochrome figures available at journals.cambridge.org/anu.

This work was supported by the Office of Advanced Scientific Computing Research, Office of Science, US Department of Energy, under Contract DE-AC02-06CH11357.

## References

#### REFERENCES

*A*122, 1–20.Google Scholar

*Lecture Notes in Computer Science*, Springer, pp. 65–76.Google Scholar

*Lecture Notes in Computer Science*, Springer, pp. 52–64.Google Scholar

*Nonconvex Optimization and its Applications*, Springer, pp. 35–59.Google Scholar

*A*104, 179–202.Google Scholar

*a*), ‘The split closure of a strictly convex body’, Oper. Res. Lett. 39, 121–126.Google Scholar

*b*), ‘The Chvátal–Gomory closure of a strictly convex body’, Math. Oper. Res. 36, 227–239.Google Scholar

*c*), On the Chvátal–Gomory closure of a compact convex set. In Integer Programming and Combinatorial Optimization (Günlük, O. and Woeginger, G., eds), Vol. 6655 of

*Lecture Notes in Computer Science*, Springer, pp. 130–142.Google Scholar

*d*), Enumerative lattice algorithms in any norm via M-ellipsoid coverings. In IEEE 52nd Annual Symposium on Foundations of Computer Science: FOCS, pp. 580–589.Google Scholar

*B*136, 375–402.Google Scholar

*Lecture Notes in Computer Science*, Springer, pp. 327–340.Google Scholar

*B*26, 1–13.Google Scholar

*The IMA Volumes in Mathematics and its Applications*, Springer, pp. 287–314.Google Scholar

*B*104, 186–203.Google Scholar

^{O(n log n)}’, Discrete Optim. 10, 69–84.Google Scholar

*Lecture Notes in Economics and Mathematical Systems*, Springer, pp. 161–172.Google Scholar

*ab initio*prediction of three-dimensional structures of proteins from the amino acid sequence’, Biophysical J. 85, 2119–2146.Google Scholar

*p*-order conic constraints: A linear programming approach’, European J. Oper. Res. 201, 653–671.Google Scholar

*Lecture Notes in Computer Science*, Springer, pp. 293–303.Google Scholar

*B*103, 251–282.Google Scholar

*C*113, 10493–10499.Google Scholar

*n*-step conic mixed integer rounding inequalities’, Optimization Online. http://www.optimization-online.org/DB_HTML/2011/11/3251.htmlGoogle Scholar

*C*114, 20741–20748.Google Scholar

*Lecture Notes in Computer Science*, Springer, pp. 32–42.Google Scholar

*B*45, 139–172.Google Scholar

*The IMA Volumes in Mathematics and its Applications*, Springer, pp. 407–426.Google Scholar

*a*), ‘A branch-and-cut algorithm for nonconvex quadratic programs with box constraints’, Math. Program. 102, 559–575.Google Scholar

*b*), ‘A polyhedral study of nonconvex quadratic programs with box constraints’, Math. Program. 102, 531–557.Google Scholar

*a*), ‘Balancing terrorism and natural disasters: Defensive strategy with endogenous attacker effort’, Oper. Res. 55, 976–991.Google Scholar

*b*), ‘Investment in security’, Industrial Engineer 39, 53–54.Google Scholar

- 424
- Cited by