A New Foundation for a Simplified Primal Integer Programming Algorithm
Published Online:1 Aug 1968https://doi.org/10.1287/opre.16.4.727
Abstract
Following the approach underlying the Pseudo Primal-Dual Integer Programming Algorithm, a new foundation for a simplified primal integer programming algorithm is given. In addition, new choice rules are prescribed which guarantee finite convergence, and a criterion of optimality is introduced that permits the algorithm to terminate before dual feasibility is achieved.
