Cycling problems in linear programming

2021/01/05 by Yang, Yaguang
#FOS: Mathematics #Optimization and Control (math.OC)

paper · doi:10.48550/arxiv.2101.01805

Abstract

This paper provides a set of cycling problems in linear programming. These problems should be useful for researchers to develop and test new simplex algorithms. As matter of the fact, this set of problems is used to test a recently proposed double pivot simplex algorithm for linear programming.

Related

• The simplest examples where the simplex method cycles and conditions where EXPAND fails to prevent cycling
• A double-pivot degenerate-robust simplex algorithm for linear programming
• On the facet pivot simplex method for linear programming
• Linear Programming, the Simplex Algorithm and Simple Polytopes
• The existence of a strongly polynomial time simplex algorithm for linear programs