On Subadditive Duality for Conic Mixed-integer Programs
From MaRDI portal
Publication:5234281
DOI10.1137/18M1210812zbMath1422.90029arXiv1808.10419WikidataQ127226528 ScholiaQ127226528MaRDI QIDQ5234281
Burak Kocuk, Diego A. Morán R.
Publication date: 26 September 2019
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1808.10419
Mixed integer programming (90C11) Optimality conditions and duality in mathematical programming (90C46)
Related Items
Theorems of the alternative for conic integer programming, Exact Augmented Lagrangian Duality for Mixed Integer Quadratic Programming
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Duality for mixed-integer convex minimization
- Using cuts for mixed integer knapsack sets to generate cuts for mixed integer polyhedral conic sets
- On sublinear inequalities for mixed integer conic programs
- Some properties of convex hulls of integer points contained in general convex sets
- Exact augmented Lagrangian duality for mixed integer linear programming
- Progress in computational mixed integer programming -- a look back from the other side of the tipping point
- Extended duality for nonlinear programming
- Conic mixed-integer rounding cuts
- Optimality certificates for convex minimization and Helly numbers
- Some cut-generating functions for second-order conic sets
- Disjunctive cuts for cross-sections of the second-order cone
- Mixed-integer second-order cone programming for lower hedging of American contingent claims in incomplete markets
- Cuts for mixed 0-1 conic programming
- Lectures on Modern Convex Optimization
- On Maximal $S$-Free Sets and the Helly Number for the Family of $S$-Convex Sets
- On Maximal S-Free Convex Sets
- Maximal Lattice-Free Convex Sets in Linear Subspaces
- Closedness of Integer Hulls of Simple Conic Sets
- Integer programming duality: Price functions and sensitivity analysis
- On the existence of optimal solutions to integer and mixed-integer programming problems
- A Strong Dual for Conic Mixed-Integer Programs
- Cut-Generating Functions and S-Free Sets
- New Algorithms for k-Center and Extensions
- Convex Analysis
