A complete characterization of disjunctive conic cuts for mixed integer second order cone optimization

DOI10.1016/j.disopt.2016.10.001zbMath1387.90184OpenAlexW2547864521MaRDI QIDQ1751214

Ted K. Ralphs, Imre Pólik, Tamás Terlaky, Pietro Belotti, Julio César Góez

Publication date: 24 May 2018

Published in: Discrete Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disopt.2016.10.001

zbMATH Keywords

disjunctive programmingmixed integer optimizationsecond order cone optimizationdisjunctive conic cuts

Mathematics Subject Classification ID

Convex programming (90C25) Mixed integer programming (90C11)

Related Items

Convex hull of two quadratic or a conic quadratic and a quadratic inequality, Mixed-integer second-order cone optimization for composite discrete ply-angle and thickness topology optimization problems, Scanning integer points with lex-inequalities: a finite cutting plane algorithm for integer programming with linear objective, On pathological disjunctions and redundant disjunctive conic cuts

Cites Work

• Unnamed Item
• Unnamed Item
• Valid inequalities for mixed integer linear programs
• Split cuts and extended formulations for mixed integer conic quadratic programming
• A branch-and-cut method for 0-1 mixed convex programming
• The split closure of a strictly convex body
• On families of quadratic surfaces having fixed intersections with two hyperplanes
• Cuts for mixed 0-1 conic programming
• Outline of an algorithm for integer solutions to linear programs
• A Conic Representation of the Convex Hull of Disjunctive Sets and Conic Cuts for Integer Second Order Cone Optimization
• Disjunctive Programming
• Intersection Cuts for Mixed Integer Conic Quadratic Sets
• Two-Term Disjunctions on the Second-Order Cone
• Some Modified Matrix Eigenvalue Problems
• Intersection cuts for nonlinear integer programming: convexification techniques for structured sets