A Finitely Convergent Duality Theory for Zero-One Integer Programming
David Elliott Bell, Jeremy F. Shapiro · IIASA PURE (International Institute of Applied Systems Analysis) · 1975
Given an integer programming problem, a constructive procedure is presented for generating a finite sequence of increasingly stronger dual problems to the given problem. The last dual problem in the sequence yields an optimal solution to the given integer programming problem. It is shown that this dual problem approximates the convex hull of the feasible integer solutions in a neighborhood of the optimal solution it finds. The theory is applicable to any bounded integer programming problem with rational data.