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 > Reformulating mixed-integer quadratically const...
View graph of relations

« Back

Reformulating mixed-integer quadratically constrained quadratic programs

Research output: Working paper


Publication date2011
Place of publicationLancaster University
PublisherThe Department of Management Science
Number of pages23
<mark>Original language</mark>English

Publication series

NameManagement Science Working Paper Series
PublisherLancaster University


It is well known that semidefinite programming (SDP) can be used to derive useful relaxations for a variety of optimisation problems. Moreover, in the particular case of mixed-integer quadratic programs, SDP has been used to reformulate problems, rather than merely relax them. The purpose of reformulation is to strengthen the continuous relaxation of the problem, while leaving the optimal solution unchanged. In this paper, we explore the possibility of extending the reformulation approach to the (much) more general case of mixed-integer quadratically constrained quadratic programs.

Bibliographic note

This was eventually published as: L. Galli & A.N. Letchford (2014) A compact variant of the QCR method for quadratically constrained quadratic 0-1 programs. Optim. Lett., 8(4), 1213-1224.

Related projects