Cycling in the dual simplex algorithm

This note describes the construction of an example in which the usual iterative method for linear programming may fail unless special techniques for overcoming degeneracy are used.

[1]  C. E. Lemke,et al.  The dual method of solving the linear programming problem , 1954 .

[2]  E. M. L. Beale,et al.  An alternative method for linear programming , 1954, Mathematical Proceedings of the Cambridge Philosophical Society.