We have over 12,000 students, from over 100 countries, within one of the safest campuses in the UK


97% of Lancaster students go into work or further study within six months of graduating

Home > Research > Publications & Outputs > Non-convex mixed-integer nonlinear programming:...
View graph of relations

« Back

Non-convex mixed-integer nonlinear programming: a survey

Research output: Contribution to journalJournal article


<mark>Journal publication date</mark>2012
<mark>Journal</mark>Surveys in Operations Research and Management Science
Number of pages10
<mark>Original language</mark>English


A wide range of problems arising in practical applications can be formulated as Mixed-Integer Nonlinear Programs (MINLPs). For the case in which the objective and constraint functions are convex, some quite effective exact and heuristic algorithms are available. When nonconvexities are present, however, things become much more difficult, since then even the continuous relaxation is a global optimisation problem. We survey the literature on non-convex MINLP, discussing applications, algorithms and software. Special attention is paid to the case in which the objective and constraint functions are quadratic.

Related projects