A Convergent Duality Theory for Integer Programming

DOI10.1287/opre.25.3.419zbMath0381.90079OpenAlexW2065609626MaRDI QIDQ4161087

David E. Bell, Jeremy F. Shapiro

Publication date: 1977

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

Full work available at URL: https://doi.org/10.1287/opre.25.3.419

Mathematics Subject Classification ID

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

Related Items

Symmetric duality for disjunctive programming with absolute value functionals, Multiple cost coefficients sensitivity theorems of integer linear optimization, Constructive dual methods for discrete programming, Theoretical challenges towards cutting-plane selection, Efficient group cuts for integer programs, Convergent duality for the traveling salesman problem, Computing exact solution to nonlinear integer programming: convergent Lagrangian and objective level cut method, Non-standard approaches to integer programming, Metodos Duales y algoritmos hibridos para problemas de «Set Partitioning», Subadditive duality in multiobjective integer linear programming, Towards strong duality in integer programming, Convergent Lagrangian and domain cut method for nonlinear knapsack problems, Integer programming duality: Price functions and sensitivity analysis, Distance confined path problem and separable integer programming, A transformation of hard (equality constrained) knapsack problems into constrained shortest path problems, Generalized nonlinear Lagrangian formulation for bounded integer programming, A nonlinear Lagrangian dual for integer programming