Title of article
Cycling in linear programming problems
Author/Authors
Saul I. Gass، نويسنده , , Sasirekha Vinjamuri، نويسنده ,
Issue Information
دوهفته نامه با شماره پیاپی سال 2004
Pages
9
From page
303
To page
311
Abstract
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.
Keywords
Linear programming , degeneracy , Cycling
Journal title
Computers and Operations Research
Serial Year
2004
Journal title
Computers and Operations Research
Record number
928021
Link To Document