On the reduction method for integer linear programs. II (Q1085786): Difference between revisions

[An earlier version of this paper (formally part I) appeared under the same title as OR Report No.125, N.C. State Univ. (1980).] The problem of the sequential reduction of linear equations in non- negative discrete variables has been treated by several authors since its introduction by Elmaghraby and Wig in 1969. This paper provides tighter conditions on the multipliers, especially for the case of bivalent (0,1) variables in homogeneous equations (zero right side). The current paper extends the results of part I, and presents a comparative analysis with other approaches. In particular, we give conditions under which our multipliers are 'better' than others, where 'better' is precisely defined.