Duality for mixed-integer convex minimization

DOI10.1007/s10107-015-0917-yzbMath1358.90081arXiv1412.2515OpenAlexW1592687131MaRDI QIDQ304264

Michel Baes, Timm Oertel, Robert Weismantel

Publication date: 25 August 2016

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

Full work available at URL: https://arxiv.org/abs/1412.2515

zbMATH Keywords

dualitymixed integer convex programming

Mathematics Subject Classification ID

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

Related Items

Constructing Lattice-Free Gradient Polyhedra in Dimension Two ⋮ Lattice-free simplices with lattice width \(2d - o(d)\) ⋮ Evaluating mixed-integer programming models over multiple right-hand sides ⋮ Towards a characterization of maximal quadratic-free sets ⋮ Unnamed Item ⋮ A Unified Framework for Pricing in Nonconvex Resource Allocation Games ⋮ Enumeration and unimodular equivalence of empty delta-modular simplices ⋮ Sublinear Bounds for a Quantitative Doignon--Bell--Scarf Theorem ⋮ Optimality certificates for convex minimization and Helly numbers ⋮ On Subadditive Duality for Conic Mixed-integer Programs ⋮ An exact projection-based algorithm for bilevel mixed-integer problems with nonlinearities ⋮ Constructing lattice-free gradient polyhedra in dimension two

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Cutting-plane theory: Algebraic methods
• A reformulation-linearization technique for solving discrete and continuous nonconvex problems
• Introductory lectures on convex optimization. A basic course.
• Convexity in cristallographical lattices
• A Lagrangian Relaxation View of Linear and Semidefinite Hierarchies
• Transversal numbers over subsets of linear spaces
• A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
• Disjunctive Programming and a Hierarchy of Relaxations for Discrete Optimization Problems
• Minimal inequalities
• Cones of Matrices and Set-Functions and 0–1 Optimization
• On the Group Problem and a Subadditive Approach to Integer Programming
• An Introduction to the Theory of Cutting-Planes
• Discrete Convex Analysis
• A Strong Dual for Conic Mixed-Integer Programs
• The Traveling-Salesman Problem and Minimum Spanning Trees
• A Comparison of the Sherali-Adams, Lovász-Schrijver, and Lasserre Relaxations for 0–1 Programming