Exact quadratic convex reformulations of mixed-integer quadratically constrained problems - Archive ouverte HAL Access content directly
Journal Articles Mathematical Programming Year : 2016

Exact quadratic convex reformulations of mixed-integer quadratically constrained problems

(1) , (1, 2) , (3)
1
2
3

Abstract

We propose a solution approach for the general problem (QP) of minimizing a quadratic function of bounded integer variables subject to a set of quadratic constraints. The resolution is based on the reformulation of the original problem (QP) into an equivalent quadratic problem whose continuous relaxation is convex, so that it can be effectively solved by a branch-and-bound algorithm based on quadratic convex relaxation. We concentrate our efforts on finding a reformulation such that the continuous relaxation bound of the reformulated problem is as tight as possible. Furthermore, we extend our method to the case of mixed-integer quadratic problems with the following restriction: all quadratic sub-functions of purely continuous variables are already convex. Finally, we illustrate the different results of the article by small examples and we present some computational experiments on pure-integer and mixed-integer instances of (QP). Most of the considered instances with up to 53 variables can be solved by our approach combined with the use of Cplex.
Fichier principal
Vignette du fichier
MIQCRQ_BB.pdf (556.91 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-02922683 , version 1 (03-09-2020)

Identifiers

Cite

Alain Billionnet, Sourour Elloumi, Amélie Lambert. Exact quadratic convex reformulations of mixed-integer quadratically constrained problems. Mathematical Programming, 2016, 158 (1-2), pp.235-266. ⟨10.1007/s10107-015-0921-2⟩. ⟨hal-02922683⟩
52 View
170 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More