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.
CITATION STYLE
Lubin, M., Zadik, I., & Vielma, J. P. (2017). Mixed-integer convex representability. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10328 LNCS, pp. 392–404). Springer Verlag. https://doi.org/10.1007/978-3-319-59250-3_32
Mendeley helps you to discover research relevant for your work.