A strong dual for conic mixed-integer programs

DOI10.1137/110840868MaRDI QIDQ4899028zbMATH OpenOpenAlexFDO

Authors Diego Morán, J. P. Vielma, Santanu S. Dey

Publication date 4 January 2013

Published in SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/110840868

zbMATH Keywords

cutting planesdualityconic programmingmixed-integer linear programming

Mathematics Subject Classification ID

Optimality conditions and duality in mathematical programming (90C46) Mixed integer programming (90C11)

Recommendations

• On Subadditive Duality for Conic Mixed-integer Programs
• Duality for mixed-integer convex minimization
• Proving strong duality for geometric optimization using a conic formulation
• Duality for mixed-integer linear programs
• Strong duality for standard convex programs

Cited in

(20)

• On minimal valid inequalities for mixed integer conic programs
• Enumeration and unimodular equivalence of empty delta-modular simplices
• Optimality certificates for convex minimization and Helly numbers
• Duality for mixed-integer linear programs
• Exact augmented Lagrangian duality for mixed integer quadratic programming
• Separated continuous conic programming: strong duality and an approximation algorithm
• Some cut-generating functions for second-order conic sets
• Theoretical challenges towards cutting-plane selection
• Convex hull of two quadratic or a conic quadratic and a quadratic inequality
• Duality for mixed-integer convex minimization
• On sublinear inequalities for mixed integer conic programs
• Lattice-free simplices with lattice width \(2d - o(d)\)
• Strong formulations for conic quadratic optimization with indicator variables
• Mixed-integer convex representability
• Intersection cuts for nonlinear integer programming: convexification techniques for structured sets
• Exploring the limits of subadditive approaches: parallels between optimization and complexity theory
• Split cuts and extended formulations for mixed integer conic quadratic programming
• Cut-generating functions for integer variables
• Theorems of the alternative for conic integer programming
• On Subadditive Duality for Conic Mixed-integer Programs

This page was built for publication: A strong dual for conic mixed-integer programs

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