Cycling in linear programming problems

DOI10.1016/S0305-0548(02)00226-5zbMath1057.90033OpenAlexW2011131760MaRDI QIDQ1765542

Sasirekha Vinjamuri, Saul I. Gass

Publication date: 23 February 2005

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0305-0548(02)00226-5

zbMATH Keywords

Linear programmingDegeneracyCycling

Mathematics Subject Classification ID

Linear programming (90C05)

Related Items (7)

On detecting nonlinear patterns in discriminant problems ⋮ On Hoffman's celebrated cycling LP example ⋮ Exact optimization for the \(\ell ^{1}\)-compressive sensing problem using a modified Dantzig-Wolfe method ⋮ A note on cycling LP examples with permutation structure ⋮ The double pivot simplex method ⋮ Cycling in linear programming problems ⋮ Systematic construction of examples for cycling in the simplex method

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Encounters with degeneracy: A personal view
• Cycling in linear programming problems
• The efficient solution of large-scale linear programming problems—some algorithmic techniques and computational results
• Classroom Note:Hoffman's Circle Untangled
• Cycling in the transportation problem
• A note on cycling in the simplex method
• Duality Theory of Linear Programs: A Constructive Approach with Applications

This page was built for publication: Cycling in linear programming problems