Two-Term Disjunctions on the Second-Order Cone
- Cite this paper as:
- Kılınç-Karzan F., Yıldız S. (2014) Two-Term Disjunctions on the Second-Order Cone. In: Lee J., Vygen J. (eds) Integer Programming and Combinatorial Optimization. IPCO 2014. Lecture Notes in Computer Science, vol 8494. Springer, Cham
Balas introduced disjunctive cuts in the 1970s for mixed-integer linear programs. Several recent papers have attempted to extend this work to mixed-integer conic programs. In this paper we develop a methodology to derive closed-form expressions for inequalities describing the convex hull of a two-term disjunction applied to the second-order cone. Our approach is based on first characterizing the structure of undominated valid linear inequalities for the disjunction and then using conic duality to derive a family of convex, possibly nonlinear, valid inequalities that correspond to these linear inequalities. We identify and study the cases where these valid inequalities can equivalently be expressed in conic quadratic form and where a single inequality from this family is sufficient to describe the convex hull. Our results on two-term disjunctions on the second-order cone generalize related results on split cuts by Modaresi, Kılınç, and Vielma, and by Andersen and Jensen.
KeywordsMixed-integer conic programming second-order cone programming cutting planes disjunctive cuts
Unable to display preview. Download preview PDF.