Advertisement

Mathematical Programming

, Volume 162, Issue 1–2, pp 225–240 | Cite as

Mixed-integer quadratic programming is in NP

  • Alberto Del Pia
  • Santanu S. Dey
  • Marco Molinaro
Full Length Paper Series A

Abstract

Mixed-integer quadratic programming is the problem of optimizing a quadratic function over points in a polyhedral set where some of the components are restricted to be integral. In this paper, we prove that the decision version of mixed-integer quadratic programming is in NP, thereby showing that it is NP-complete. This is established by showing that if the decision version of mixed-integer quadratic programming is feasible, then there exists a solution of polynomial size. This result generalizes and unifies classical results that quadratic programming is in NP (Vavasis in Inf Process Lett 36(2):73–77 [17]) and integer linear programming is in NP (Borosh and Treybig in Proc Am Math Soc 55:299–304 [1], von zur Gathen and Sieveking in Proc Am Math Soc 72:155–158 [18], Kannan and Monma in Lecture Notes in Economics and Mathematical Systems, vol. 157, pp. 161–172. Springer [9], Papadimitriou in J Assoc Comput Mach 28:765–768 [15]).

Keywords

Quadratic programming Integer programming Complexity 

Mathematics Subject Classification

90C11 90C20 90C60 

References

  1. 1.
    Borosh, I., Treybig, L.B.: Bounds on positive integral solutions to linear Diophantine equations. Proc. Am. Math. Soc. 55, 299–304 (1976)MathSciNetCrossRefzbMATHGoogle Scholar
  2. 2.
    Cook, W., Kannan, R., Schrijver, A.: Chvátal closures for mixed integer programming problems. Math. Program. 47(1–3), 155–174 (1990)CrossRefzbMATHGoogle Scholar
  3. 3.
    De Loera, J., Hemmecke, R., Köppe, M., Weismantel, R.: FPTAS for optimizing polynomials over the mixed-integer points of polytopes in fixed dimension. Math. Program., Ser. A 118, 273–290 (2008)MathSciNetCrossRefzbMATHGoogle Scholar
  4. 4.
    Del Pia, A., Weismantel, R.: Integer quadratic programming in the plane. In: Chekuri, C. (ed.) SODA, pp. 840–846. SIAM (2014)Google Scholar
  5. 5.
    Garey, M., Johnson, D., Stockmeyer, L.: Some simplified NP-complete graph problems. Theor. Comput. Sci. 1(3), 237–267 (1976)MathSciNetCrossRefzbMATHGoogle Scholar
  6. 6.
    Hartmann, M.: Cutting planes and the complexity of the integer hull. Tech. Rep. 819, School of Operations Research and Industrial Engineering, Cornell University (1989)Google Scholar
  7. 7.
    Hildebrand, R., Oertel, T., Weismantel, R.: Note on the complexity of the mixed-integer hull of a polyhedron. Oper. Res. Lett. 43, 279–282 (2015)MathSciNetCrossRefGoogle Scholar
  8. 8.
    Jeroslow, R.: There cannot be any algorithm for integer programming with quadratic constraints. Oper. Res. 21(1), 221–224 (1973)MathSciNetCrossRefzbMATHGoogle Scholar
  9. 9.
    Kannan, R., Monma, C.L.: On the computational complexity of integer programming problems. In: Henn, R., Korte, B., Oettli, W. (eds.) Lecture Notes in Economics and Mathematical Systems, vol. 157, pp. 161–172. Springer, Heidelberg (1978)Google Scholar
  10. 10.
    Karp, R.: Reducibility among combinatorial problems. In: Millera, R.E., Thatcher, J.W. (eds.) Complexity of Computer Computations. New York (1972)Google Scholar
  11. 11.
    Khachiyan, L.: Convexity and complexity in polynomial programming. In: Proceedings of the International Congress of Mathematicians, pp. 1569–1577. Warsaw (1983)Google Scholar
  12. 12.
    Koeppe, M.: On the complexity of nonlinear mixed-integer optimization. In: Lee, J., Leyffer, S. (eds.) Mixed Integer Nonlinear Programming, The IMA Volumes in Mathematics and its Applications, vol. 154, pp. 533–557. Springer, New York (2012). doi: 10.1007/978-1-4614-1927_19
  13. 13.
    Lagarias, J.C.: On the computational complexity of determining the solvability or unsolvability of the equation \(x^2 - dy^2 = -1\). Trans. Am. Math. Soc. 260, 485–508 (1980)MathSciNetzbMATHGoogle Scholar
  14. 14.
    Murty, K., Kabadi, S.: Some NP-complete problems in quadratin and nonlinear programming. Math. Program. 39, 117–129 (1987)CrossRefzbMATHGoogle Scholar
  15. 15.
    Papadimitriou, C.H.: On the complexity of integer programming. J. Assoc. Comput. Mach. 28, 765–768 (1981)MathSciNetCrossRefzbMATHGoogle Scholar
  16. 16.
    Schrijver, A.: Theory of Linear and Integer Programming. Wiley, New York (1986)zbMATHGoogle Scholar
  17. 17.
    Vavasis, S.A.: Quadratic programming is in NP. Inf. Process. Lett. 36(2), 73–77 (1990)MathSciNetCrossRefzbMATHGoogle Scholar
  18. 18.
    von zur Gathen, J., Sieveking, M.: A bound on solutions of linear integer equalities and inequalities. Proc. Am. Math. Soc. 72, 155–158 (1978)MathSciNetCrossRefzbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg and Mathematical Optimization Society 2016

Authors and Affiliations

  • Alberto Del Pia
    • 1
  • Santanu S. Dey
    • 2
  • Marco Molinaro
    • 2
  1. 1.Department of Industrial and Systems Engineering & Wisconsin Institute for DiscoveryUniversity of Wisconsin-MadisonMadisonUSA
  2. 2.Computer Science DepartmentPUC-RioRio de JaneiroBrazil

Personalised recommendations