A strong dual for conic mixed-integer programs
From MaRDI portal
Publication:4899028
DOI10.1137/110840868zbMATH Open1262.90111OpenAlexW1980379820MaRDI QIDQ4899028FDOQ4899028
Santanu S. Dey, Diego Morán, J. P. Vielma
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
Recommendations
Optimality conditions and duality in mathematical programming (90C46) Mixed integer programming (90C11)
Cited In (19)
- On minimal valid inequalities for mixed integer conic programs
- Optimality certificates for convex minimization and Helly numbers
- Duality for mixed-integer linear programs
- Some cut-generating functions for second-order conic sets
- Theoretical challenges towards cutting-plane selection
- Exploring the Limits of Subadditive Approaches: Parallels between Optimization and Complexity Theory
- Convex hull of two quadratic or a conic quadratic and a quadratic inequality
- Duality for mixed-integer convex minimization
- Lattice-free simplices with lattice width \(2d - o(d)\)
- On sublinear inequalities for mixed integer conic programs
- Strong formulations for conic quadratic optimization with indicator variables
- Intersection cuts for nonlinear integer programming: convexification techniques for structured sets
- Cut-generating functions for integer variables
- Split cuts and extended formulations for mixed integer conic quadratic programming
- Theorems of the alternative for conic integer programming
- Exact Augmented Lagrangian Duality for Mixed Integer Quadratic Programming
- On Subadditive Duality for Conic Mixed-integer Programs
- Mixed-Integer Convex Representability
- Enumeration and unimodular equivalence of empty delta-modular simplices
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)
