1. Hoffman, A. (1953), Cycling in the simplex algorithm, Technical Report 2974, National Bureau of Standards.
2. Marshall, K. & Suurballe, J. (1969), ‘A note on cycling in the simplex method’, Naval Research Logistics Quarterly 16, 121–137.
3. Charnes, A. (1952), ‘Optimality and degeneracy in linear programming’, Econometrica 20, 160–170.
4. Dantzig, G., Orden, A. & Wolfe, P. (1955), ‘The generalized simplex method for minimizing a linear form under linear inequality constraints’, Pacific Journal of Mathematics 5, 183–195.
5. Bland, R. (1977), ‘New finite pivoting rules for the simplex method’, Mathematics of Operations Research 2, 103–107.