We study the convex hull of the intersection of a disjunctive set defined by parallel hyperplanes and the feasible set of a mixed integer second order cone optimization problem. We extend our prior work on disjunctive conic cuts, which has thus far been restricted to the case in which the intersection of the hyperplanes and the feasible set is bounded. Using a similar technique, we show that one can extend our previous results to the case in which that intersection is unbounded. We provide a complete characterization in closed form of the conic inequalities required to describe the convex hull when the hyperplanes defining the disjunction are parallel.
Accepted for publication in Discrete Optimization. Lehigh ISE Tech Report 14T-008 https://ise.lehigh.edu/content/complete-characterization-disjunctive-conic-cuts-mixed-integer-second-order-cone
View A Complete Characterization of Disjunctive Conic Cuts for Mixed Integer Second Order Cone Optimization