On sublinear inequalities for mixed integer conic programs

DOI10.1007/S10107-015-0968-0MaRDI QIDQ312706zbMATH OpenOpenAlexFDO

Authors 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

cut-generating functionsmixed integer conic programmingsublinear inequalitiesvalid inequalities

Mathematics Subject Classification ID

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

Recommendations

• On minimal valid inequalities for mixed integer conic programs
• Some cut-generating functions for second-order conic sets
• Two-term disjunctions on the second-order cone
• Two-term disjunctions on the second-order cone
• Cut-generating functions

Cites work

• A characterization of minimal valid inequalities for mixed integer programs
• A conic representation of the convex hull of disjunctive sets and conic cuts for integer second order cone optimization
• A strong dual for conic mixed-integer programs
• Conic mixed-integer rounding cuts
• Convex Analysis
• Cut-generating functions and S-free sets
• Cutting-plane theory: Algebraic methods
• Cutting-Planes for Optimization of Convex Functions over Nonconvex Sets
• Disjunctive cuts for cross-sections of the second-order cone
• How to convexify the intersection of a second order cone and a nonconvex quadratic
• scientific article; zbMATH DE number 193411 (Why is no real title available?)
• scientific article; zbMATH DE number 3555734 (Why is no real title available?)
• Intersection cuts for mixed integer conic quadratic sets
• Intersection cuts for nonlinear integer programming: convexification techniques for structured sets
• Lectures on modern convex optimization. Analysis, algorithms, and engineering applications
• Minimal inequalities
• Minimal Inequalities and Subadditive Duality
• Minimal inequalities for an infinite relaxation of integer programs
• Minimal inequalities for mixed integer programs
• Minimal valid inequalities for integer constraints
• On families of quadratic surfaces having fixed intersections with two hyperplanes
• On minimal valid inequalities for mixed integer conic programs
• Some continuous functions related to corner polyhedra
• Split cuts and extended formulations for mixed integer conic quadratic programming
• Sufficiency of cut-generating functions
• The split closure of a strictly convex body
• Two-term disjunctions on the second-order cone
• Two-term disjunctions on the second-order cone

Cited in

(7)

• Certificates of optimality for mixed integer linear programming using generalized subadditive generator functions
• Some cut-generating functions for second-order conic sets
• On minimal valid inequalities for mixed integer conic programs
• Submodularity in Conic Quadratic Mixed 0–1 Optimization
• On Subadditive Duality for Conic Mixed-integer Programs
• Disjunctive cuts in mixed-integer conic optimization
• On SOCP-based disjunctive cuts for solving a class of integer bilevel nonlinear programs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q312706)