Theorems of the alternative for conic integer programming

DOI10.1016/j.orl.2020.04.003OpenAlexW3016798895MaRDI QIDQ2183216

Varun Suriyanarayana, Temitayo Ajayi, Andrew J. Schaefer

Publication date: 26 May 2020

Published in: Operations Research Letters (Search for Journal in Brave)

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

zbMATH Keywords

superadditivityFarkas' lemmaconic integer programming

Mathematics Subject Classification ID

Calculus of variations and optimal control; optimization (49-XX) Operations research, mathematical programming (90-XX)

Cites Work

• Binary positive semidefinite matrices and associated integer polytopes
• Applications of second-order cone programming
• Second-order cone programming
• Cutting planes from a mixed integer Farkas lemma.
• Condition number complexity of an elementary algorithm for computing a reliable solution of a conic linear system
• On a positive semidefinite relaxation of the cut polytope
• A discrete Farkas lemma
• Cuts for mixed 0-1 conic programming
• The value function of an integer program
• Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
• Semidefinite Programming
• A Strong Dual for Conic Mixed-Integer Programs
• On Subadditive Duality for Conic Mixed-integer Programs
• On a Level-Set Characterization of the Value Function of an Integer Program and Its Application to Stochastic Programming
• Superadditive characterizations of pure integer programming feasibility
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item