A presentation of a new technique for resolving degeneracy in the simplex-method solution of linear programming problems. Unlike other lexicographic techniques, it uses only data associated with the right-hand side of the linear programming problem and is thus simpler both theoretically and computationally. Some experimental results are also given relating to the effect of degeneracy on the course of the ordinary simplex algorithm
This report is part of the RAND Corporation research memorandum series. The Research Memorandum was a product of the RAND Corporation from 1948 to 1973 that represented working papers meant to report current results of RAND research to appropriate audiences.
The RAND Corporation is a nonprofit institution that helps improve policy and decisionmaking through research and analysis. RAND's publications do not necessarily reflect the opinions of its research clients and sponsors.