  This paper provides a set of cycling problems in linear programming. These
problems should be useful for researchers to develop and test new simplex
algorithms. As matter of the fact, this set of problems is used to test a
recently proposed double pivot simplex algorithm for linear programming.
