Small and strong formulations for unions of convex sets from the Cayley embedding
Author(s)
Vielma Centeno, Juan Pablo
Download73cd25804b501f570066ff03e2f687dec06c.pdf (2.328Mb)
OPEN_ACCESS_POLICY
Open Access Policy
Creative Commons Attribution-Noncommercial-Share Alike
Terms of use
Metadata
Show full item recordAbstract
There is often a significant trade-off between formulation strength and size in mixed integer programming (MIP). When modelling convex disjunctive constraints (e.g. unions of convex sets) this trade-off can be resolved by adding auxiliary continuous variables. However, adding these variables can result in a deterioration of the computational effectiveness of the formulation. For this reason, there has been considerable interest in constructing strong formulations that do not use continuous auxiliary variables. We introduce a technique to construct formulations without these detrimental continuous auxiliary variables. To develop this technique we introduce a natural nonpolyhedral generalization of the Cayley embedding of a family of polytopes and show it inherits many geometric properties of the original embedding. We then show how the associated formulation technique can be used to construct small and strong formulation for a wide range of disjunctive constraints. In particular, we show it can recover and generalize all known strong formulations without continuous auxiliary variables.
Date issued
2018-03Department
Sloan School of ManagementJournal
Mathematical Programming
Publisher
Springer Nature America, Inc
Citation
Vielma, Juan Pablo. “Small and Strong Formulations for Unions of Convex Sets from the Cayley Embedding.” Mathematical Programming (March 30, 2018).
Version: Author's final manuscript
ISSN
0025-5610
1436-4646