Most examples of cycling in the simplex method are given without explanation of how they were constructed. An exception is Beale's example built around the geometry of the dual simplex method in the ...

The book also addresses linear programming duality theory and its use in algorithm design as well as the Dual Simplex Method, Dantzig-Wolfe decomposition, and a primal-dual interior point algorithm.

Ron Shamir, Probabilistic Analysis in Linear Programming, Statistical Science, Vol. 8, No. 1, Report from the Committee on Applied and Theoretical Statistics of the National Research Council on ...