Year: 2011
Type: book
Abstract: 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.
Authors: Laura Galli, Adam N. Letchford
Institutions: University of Bologna, Lancaster University
Language: English
Subfield: Numerical Analysis
Field: Mathematics
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W619647352
