A Convergent Duality Theory for Integer Programming

DOI10.1287/OPRE.25.3.419MaRDI QIDQ4161087zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• scientific article; zbMATH DE number 3922373
• scientific article; zbMATH DE number 3891101
• scientific article; zbMATH DE number 3904332
• Duality in mathematics and linear and integer programming
• Constructive dual methods for discrete programming

Cited in

(29)

• Scarf's Procedure for Integer Programming and a Dual Simplex Algorithm
• Non-standard approaches to integer programming
• scientific article; zbMATH DE number 4033489 (Why is no real title available?)
• scientific article; zbMATH DE number 3878241 (Why is no real title available?)
• A transformation of hard (equality constrained) knapsack problems into constrained shortest path problems
• A monotonic, dual-based bounding procedure for integer programs
• Success guarantee of dual search in integer programming: p-th power Lagrangian method.
• Comment on A nonlinear Lagrangian dual for integer programming.
• Integer programming as projection
• Theoretical challenges towards cutting-plane selection
• Generalized nonlinear Lagrangian formulation for bounded integer programming
• Integer programming duality: Price functions and sensitivity analysis
• Efficient group cuts for integer programs
• Computing exact solution to nonlinear integer programming: convergent Lagrangian and objective level cut method
• Symmetric duality for disjunctive programming with absolute value functionals
• Convergent Lagrangian and domain cut method for nonlinear knapsack problems
• Subadditive duality in multiobjective integer linear programming
• A nonlinear Lagrangian dual for integer programming
• Convergent duality for the traveling salesman problem
• The relationship between integer and real solutions of constrained convex programming
• Multiple cost coefficients sensitivity theorems of integer linear optimization
• Metodos Duales y algoritmos hibridos para problemas de «Set Partitioning»
• scientific article; zbMATH DE number 3922373 (Why is no real title available?)
• Constructive dual methods for discrete programming
• Distance confined path problem and separable integer programming
• scientific article; zbMATH DE number 3891101 (Why is no real title available?)
• A framework for constructing general integer problems with well-determined duality gaps
• Towards strong duality in integer programming
• scientific article; zbMATH DE number 3904332 (Why is no real title available?)

This page was built for publication: A Convergent Duality Theory for Integer Programming

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