Abstract
This paper introduces two fundamental families of ‘quasi-polyhedra’ — polyhedra with a countably infinite number of facets — that arise in the context of integer quadratic programming. It is shown that any integer quadratic program can be reduced to the minimisation of a linear function over a quasi-polyhedron in the first family. Some fundamental properties of the quasi-polyhedra are derived, along with connections to some other well-studied convex sets. Several classes of facet-inducing inequalities are also derived. Finally, extensions to the mixed-integer case are briefly examined.
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
Aardal, K.I., Weismantel, R.: Polyhedral combinatorics. In: Dell’Amico, M., Mafioli, F., Martello, S. (eds.) Annotated Bibliographies in Combinatorial Optimization. Wiley, New York (1997)
Anderson, E.J., Goberna, M.A., López, M.A.: Simplex-like trajectories on quasi-polyhedral sets. Math. Oper. Res. 26, 147–162 (2001)
Balas, E.: Disjunctive programming. Ann. Discr. Math. 5, 3–51 (1979)
Boros, E., Hammer, P.L.: Cut-polytopes, Boolean quadric polytopes and nonnegative quadratic pseudo-Boolean functions. Math. Oper. Res. 18, 245–253 (1993)
Burer, S., Letchford, A.N.: On non-convex quadratic programming with box constraints. SIAM J. Opt. 20, 1073–1089 (2009)
Cook, W., Kannan, R., Schrijver, A.: Chvátal closures for mixed integer programming problems. Math. Program. 47, 155–174 (1990)
Deza, M.M., Laurent, M.: Geometry of Cuts and Metrics. Springer, Berlin (1997)
van Emde Boas, P.: Another NP-complete problem and the complexity of computing short vectors in a lattice. Technical Report 81-04, Mathematics Institute, University of Amsterdam (1981)
Khachiyan, L., Porkolab, L.: Integer optimization on convex semialgebraic sets. Discr. Comput. Geom. 23, 207–224 (2000)
Lovász, L., Schrijver, A.J.: Cones of matrices and set-functions and 0-1 optimization. SIAM J. Opt. 1, 166–190 (1991)
Michaels, D., Weismantel, R.: Polyhedra related to integer-convex polynomial systems. Math. Program. 105, 215–232 (2006)
Murty, K.G., Kabadi, S.N.: Some \(\mathcal{NP}\)-complete problems in quadratic and nonlinear programming. Math. Program. 39, 117–129 (1987)
Newman, M.: Integral Matrices. Academic Press, New York (1972)
Padberg, M.W.: The boolean quadric polytope: some characteristics, facets and relatives. Math. Program. 45, 139–172 (1989)
Ramana, M.: An Algorithmic Analysis of Multiquadratic and Semidefinite Programming Problems. PhD thesis, Johns Hopkins University, Baltimore, MD (1993)
Schrijver, A.: Combinatorial Optimization: Polyhedra and Efficiency. Springer, Berlin (2003)
Sherali, H.D., Adams, W.P.: A Reformulation-Linearization Technique for Solving Discrete and Continuous Nonconvex Problems. Kluwer, Dordrecht (1998)
Yajima, Y., Fujie, T.: A polyhedral approach for nonconvex quadratic programming problems with box constraints. J. Global Opt. 13, 151–170 (1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Letchford, A.N. (2010). Integer Quadratic Quasi-polyhedra. In: Eisenbrand, F., Shepherd, F.B. (eds) Integer Programming and Combinatorial Optimization. IPCO 2010. Lecture Notes in Computer Science, vol 6080. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-13036-6_20
Download citation
DOI: https://doi.org/10.1007/978-3-642-13036-6_20
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-13035-9
Online ISBN: 978-3-642-13036-6
eBook Packages: Computer ScienceComputer Science (R0)