Cycling in linear programming problems

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

• Type: Journal
• Year: 2004
• Where: COR
• Authors: Saul I. Gass, Sasirekha Vinjamuri
• Keywords: COR 2004, Linear Programming, Optimal Solution, Problems