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 m...
| Main Authors: | , , |
|---|---|
| Other Authors: | |
| Format: | Article |
| Published: |
Springer-Verlag
2019
|
| Online Access: | http://hdl.handle.net/1721.1/121062 https://orcid.org/0000-0001-6781-9633 https://orcid.org/0000-0002-8286-881X https://orcid.org/0000-0003-4335-7248 |