A Note on Linear Programming and Integer Feasibility
Published Online:1 Dec 1968https://doi.org/10.1287/opre.16.6.1212
Abstract
This paper proves a theorem that provides new strategies for solving integer programming problems, based on finding certain types of basic solutions to linear programs. The theorem is motivated by and extends ideas of Cabot and Hurter. An integer programming method based on the theorem is outlined.
