Abstract
Let (QP) be an integer quadratic program that consists in minimizing a quadratic function subject to linear constraints. In this paper, we present several linearizations of (QP). Many linearization methods for the quadratic 0-1 programs are known. A natural approach when considering (QP) is to reformulate it into a quadratic 0-1 program. However, this method, that we denote BBL (Binary Binary Linearization), leads to a quadratic program with a large number of variables and constraints.
Our new approach, BIL (Binary Integer Linearization), consists in reformulating (QP) into a particular quadratic integer program where each quadratic term is the product of an integer variable by a 0-1 variable. The obtained integer linear program is significantly smaller than in the BBL approach.
Each reformulation leads to an integer linear program that we improve by adding valid inequalities. Finally, we get 4 different programs that we compare from the computational point of view.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Fu, H.L., Shiue, C.L., Cheng, X., Du, D.Z., Kim, J.M.: Quadratic Integer Programming with Application in the Chaotic Mappings of Complete Multipartite Graphs. J. Optim. Theory Appl. 110(3), 545–556 (2001)
Fortet, R.: Applications de l’Algèbre de Boole en Recherche Opérationelle. Revue Française De Recherche Opérationelle 4, 17–25 (1960)
Sherali, H.D., Adams, W.P.: A tight linearization and an algorithm for zero-one quadratic programming problems. Management Science 32(10), 1274–1290 (1986)
McCormick, G.P.: Computability of global solutions to factorable nonconvex programs: Part I - Convex underestimating problems. Mathematical Programming 1(10), 147–175 (1976)
Dash Optimization, Xpress-Mosel version 1.6.1.: Xpress-Mosel language Reference Manual 1.4 (2005), http://www.dashoptimization.com/
Körner, F.: A New Bound for the Quadratic Knapsack Problem and Its Use in a Branch and Bound Algorithm. Optimization 17, 643–648 (1986)
Körner, F.: An efficient branch and bound algorithm to solve the quadratic integer programming problem. Computing 30, 253–260 (1983)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Billionnet, A., Elloumi, S., Lambert, A. (2008). Linear Reformulations of Integer Quadratic Programs. In: Le Thi, H.A., Bouvry, P., Pham Dinh, T. (eds) Modelling, Computation and Optimization in Information Systems and Management Sciences. MCO 2008. Communications in Computer and Information Science, vol 14. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-87477-5_5
Download citation
DOI: https://doi.org/10.1007/978-3-540-87477-5_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-87476-8
Online ISBN: 978-3-540-87477-5
eBook Packages: Computer ScienceComputer Science (R0)