A Strong Dual for Conic Mixed-Integer Programs

DOI10.1137/110840868zbMath1262.90111OpenAlexW1980379820MaRDI QIDQ4899028

Diego A. Morán R., Juan Pablo 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

dualitycutting planesmixed-integer linear programmingconic programming

Mathematics Subject Classification ID

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

Related Items (18)

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 ⋮ Theoretical challenges towards cutting-plane selection ⋮ Mixed-Integer Convex Representability ⋮ Lattice-free simplices with lattice width \(2d - o(d)\) ⋮ Theorems of the alternative for conic integer programming ⋮ Enumeration and unimodular equivalence of empty delta-modular simplices ⋮ Exploring the Limits of Subadditive Approaches: Parallels between Optimization and Complexity Theory ⋮ Optimality certificates for convex minimization and Helly numbers ⋮ Some cut-generating functions for second-order conic sets ⋮ Split cuts and extended formulations for mixed integer conic quadratic programming ⋮ Intersection cuts for nonlinear integer programming: convexification techniques for structured sets ⋮ Strong formulations for conic quadratic optimization with indicator variables ⋮ On Minimal Valid Inequalities for Mixed Integer Conic Programs ⋮ Cut-Generating Functions for Integer Variables ⋮ On Subadditive Duality for Conic Mixed-integer Programs ⋮ Exact Augmented Lagrangian Duality for Mixed Integer Quadratic Programming

This page was built for publication: A Strong Dual for Conic Mixed-Integer Programs