✦ LIBER ✦
A finiteness proof for modified dantzig cuts in integer programming
✍ Scribed by V. J. Bowman Jr.; G. L. Nemhauser
- Publisher
- John Wiley and Sons
- Year
- 1970
- Tongue
- English
- Weight
- 234 KB
- Volume
- 17
- Category
- Article
- ISSN
- 0894-069X
No coin nor oath required. For personal study only.
✦ Synopsis
where R is the index set associated with the nonbasic variables. If all of the variables are constrained to be nonnegative integers and xu is not an integer in the basic solution, the linear constraint is implied. We prove that including these "cuts" in a specified way yields a finite dual simplex algorithm for the pure integer programming problem. The relation of these modified Dantzig cuts to Gomory cuts is discussed.