Advertisement

Mixed-Integer Convex Representability

  • Miles Lubin
  • Ilias Zadik
  • Juan Pablo VielmaEmail author
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 10328)

Abstract

We consider the question of which nonconvex sets can be represented exactly as the feasible sets of mixed-integer convex optimization problems. We state the first complete characterization for the case when the number of possible integer assignments is finite. We develop a characterization for the more general case of unbounded integer variables together with a simple necessary condition for representability which we use to prove the first known negative results. Finally, we study representability of subsets of the natural numbers, developing insight towards a more complete understanding of what modeling power can be gained by using convex sets instead of polyhedral sets; the latter case has been completely characterized in the context of mixed-integer linear optimization.

Keywords

Natural Number Finite Union Recession Cone Rational Polyhedron Rational Subspace 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

References

  1. 1.
    Bonami, P., Kilinç, M., Linderoth, J.: Algorithms and software for convex mixed integer nonlinear programs. In: Lee, J., Leyffer, S. (eds.) Mixed Integer Nonlinear Programming. The IMA Volumes in Mathematics and its Applications, vol. 154, pp. 1–39. Springer, New York (2012)CrossRefGoogle Scholar
  2. 2.
    Ceria, S., Soares, J.: Convex programming for disjunctive convex optimization. Math. Program. 86(3), 595–614 (1999)MathSciNetCrossRefzbMATHGoogle Scholar
  3. 3.
    Del Pia, A., Poskin, J.: Ellipsoidal mixed-integer representability. Optimization Online (2016). http://www.optimization-online.org/DB_HTML/2016/05/5465.html
  4. 4.
    Dey, S.S., Morán, R., Diego, A.: Some properties of convex hulls of integer points contained in general convex sets. Math. Program. 141, 507–526 (2013)MathSciNetCrossRefzbMATHGoogle Scholar
  5. 5.
    James, J.P., Sato, D., Wada, H., Wiens, D.: Diophantine representation of the set of prime numbers. Am. Math. Mon. 83(6), 449–464 (1976)MathSciNetCrossRefzbMATHGoogle Scholar
  6. 6.
    Jeroslow, R.G., Lowe, J.K.: Modeling with integer variables. Math. Program. Stud. 22, 167–184 (1984)CrossRefzbMATHGoogle Scholar
  7. 7.
    Lubin, M., Zadik, I., Vielma, J.P.: Mixed-integer convex representability. ArXiv e-prints arXiv:1611.07491, March 2017
  8. 8.
    Lubin, M., Yamangil, E., Bent, R., Vielma, J.P.: Extended formulations in mixed-integer convex programming. In: Louveaux, Q., Skutella, M. (eds.) IPCO 2016. LNCS, vol. 9682, pp. 102–113. Springer, Cham (2016). doi: 10.1007/978-3-319-33461-5_9 Google Scholar
  9. 9.
    Vielma, J.P.: Mixed integer linear programming formulation techniques. SIAM Rev. 57(1), 3–57 (2015)MathSciNetCrossRefzbMATHGoogle Scholar

Copyright information

© Springer International Publishing AG 2017

Authors and Affiliations

  1. 1.Massachusetts Institute of TechnologyCambridgeUSA

Personalised recommendations