On sublinear inequalities for mixed integer conic programs

DOI10.1007/s10107-015-0968-0zbMath1346.90683OpenAlexW2288073279MaRDI QIDQ312706

Fatma Kılınç-Karzan, Daniel E. Steffy

Publication date: 16 September 2016

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10107-015-0968-0

zbMATH Keywords

valid inequalitiescut-generating functionsmixed integer conic programmingsublinear inequalities

Mathematics Subject Classification ID

Mixed integer programming (90C11) Nonconvex programming, global optimization (90C26)

Related Items

The structure of the infinite models in integer programming ⋮ Disjunctive cuts in mixed-integer conic optimization ⋮ Some cut-generating functions for second-order conic sets ⋮ On Subadditive Duality for Conic Mixed-integer Programs

Cites Work

• Unnamed Item
• Unnamed Item
• Sufficiency of cut-generating functions
• How to convexify the intersection of a second order cone and a nonconvex quadratic
• Conic mixed-integer rounding cuts
• Two-term disjunctions on the second-order cone
• A characterization of minimal valid inequalities for mixed integer programs
• Minimal inequalities for mixed integer programs
• Cutting-plane theory: Algebraic methods
• Split cuts and extended formulations for mixed integer conic quadratic programming
• Disjunctive cuts for cross-sections of the second-order cone
• The split closure of a strictly convex body
• On families of quadratic surfaces having fixed intersections with two hyperplanes
• Lectures on Modern Convex Optimization
• On Minimal Valid Inequalities for Mixed Integer Conic Programs
• Minimal Inequalities for an Infinite Relaxation of Integer Programs
• Minimal Valid Inequalities for Integer Constraints
• Cutting-Planes for Optimization of Convex Functions over Nonconvex Sets
• A Conic Representation of the Convex Hull of Disjunctive Sets and Conic Cuts for Integer Second Order Cone Optimization
• Minimal inequalities
• Minimal Inequalities and Subadditive Duality
• A Strong Dual for Conic Mixed-Integer Programs
• Intersection Cuts for Mixed Integer Conic Quadratic Sets
• Cut-Generating Functions and S-Free Sets
• Two-Term Disjunctions on the Second-Order Cone
• Convex Analysis
• Some continuous functions related to corner polyhedra
• Intersection cuts for nonlinear integer programming: convexification techniques for structured sets

This page was built for publication: On sublinear inequalities for mixed integer conic programs