Mixed-Integer Convex Representability
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.
KeywordsNatural Number Finite Union Recession Cone Rational Polyhedron Rational Subspace
- 3.Del Pia, A., Poskin, J.: Ellipsoidal mixed-integer representability. Optimization Online (2016). http://www.optimization-online.org/DB_HTML/2016/05/5465.html
- 7.Lubin, M., Zadik, I., Vielma, J.P.: Mixed-integer convex representability. ArXiv e-prints arXiv:1611.07491, March 2017