We collected a number of LP problems that exhibit classical cycling and ran each one using three
popular and readily available LP software packages: LINDO, C-Plex, and the Excel spreadsheet
solver. All problems were solved correctly by each package. The problem by Beale was the 4rst
one given in terms of rational coe6cients. For each problem, we note the number of iterations that
returns the problem to its original form, that is, the number of iterations it takes to cycle when the
problem is solved by hand using the standard simplex rules. When 4nding an optimal solution for
these cycling problems using LP software, the iteration count does not reQect the cycle count. For
example, the problem of Section 4.3 cycles in 6 iterations, but is solved by LINDO in one iteration.
Some of the problems have multiple optimal solutions; we list only one