Exact quadratic convex reformulations of mixed-integer quadratically constrained problems
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.
KeywordsInteger quadratic programming Equivalent convex reformulation Semidefinite programming Branch-and-bound algorithm
Mathematics Subject Classification90C11 90C20
- 1.Adams, W.P., Sherali, H.D.: Reformulation linearization technique for discrete optimization problems. In: Pardalos, Panos M., Du, Ding-Zhu, Graham, Ronald L. (eds.) Handbook of Combinatorial Optimization, pp. 2849–2896. Springer, New York (2013)Google Scholar
- 7.Billionnet, A., Elloumi, S., Lambert, A.: Linear reformulations of integer quadratic programs. In: MCO 2008, September 8–10, pp. 43–51 (2008)Google Scholar
- 14.IBM-ILOG. Ibm ilog cplex 12.5 reference manual. http://pic.dhe.ibm.com/infocenter/cosinfoc/v12r2/index.jsp (2013)
- 15.Lambert, A.: IQCP/MIQCP: Library of integer and mixed-integer quadratic quadratically constrained programs. http://cedric.cnam.fr/~lambe_a1/smiqp/Library/iqcp_miqcp.html (2013)