Superadditive characterizations of pure integer programming feasibility

DOI10.1007/S11590-015-0885-4zbMATH Open1360.90172OpenAlexW1980843595MaRDI QIDQ5963699FDOQ5963699

Andrew J. Schaefer, Amin Dehghanian

Publication date: 23 February 2016

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-015-0885-4

zbMATH Keywords

Farkas' lemmasuperadditive dualityinteger programming feasibility

Mathematics Subject Classification ID

Optimality conditions and duality in mathematical programming (90C46) Integer programming (90C10)

Cites Work

• Title not available (Why is that?)
• L-shaped decomposition of two-stage stochastic programs with integer recourse
• The Theory and Computation of Knapsack Functions
• Integer programming duality: Price functions and sensitivity analysis
• The value function of an integer program
• On a Level-Set Characterization of the Value Function of an Integer Program and Its Application to Stochastic Programming
• Cutting planes from a mixed integer Farkas lemma.
• Inference-Based Sensitivity Analysis for Mixed Integer/Linear Programming
• A discrete Farkas lemma

Cited In (3)

• Title not available (Why is that?)
• Lifting, superadditivity, mixed integer rounding and single node flow sets revisited
• Theorems of the alternative for conic integer programming

This page was built for publication: Superadditive characterizations of pure integer programming feasibility

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5963699)