| Article ID: | iaor20043328 |
| Country: | United Kingdom |
| Volume: | 31 |
| Issue: | 2 |
| Start Page Number: | 303 |
| End Page Number: | 311 |
| Publication Date: | Feb 2004 |
| Journal: | Computers and Operations Research |
| Authors: | Gass Saul I., Vinjamuri Sasirekha |
We collected and analyzed a number of linear programming problems that have been shown to cycle (not converge) when solved by Dantzig's original simplex algorithm. For these problems, we were interested in whether or not some of the more popular linear programming solvers would find an optimal solution. This technical note reviews the results of our analysis and some related topics on cycling.