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


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

Home > Research > Publications & Outputs > Unbounded convex sets for non-convex mixed-inte...
View graph of relations

« Back

Unbounded convex sets for non-convex mixed-integer quadratic programming

Research output: Contribution to journalJournal article


Journal publication date1/02/2014
JournalMathematical Programming
Number of pages26
Early online date19/10/12
Original languageEnglish


This paper introduces a fundamental family of unbounded convex sets that arises in the context of non-convex mixed-integer quadratic programming. It is shown that any mixed-integer quadratic program with linear constraints can be reduced to the minimisation of a linear function over a face of a set in the family. Some fundamental properties of the convex sets are derived, along with connections to some other well-studied convex sets. Several classes of valid and facet-inducing inequalities are also derived.

Related projects