An exponential example for Terlaky's pivoting rule for the criss-cross simplex method

@article{Roos1990AnEE,
  title={An exponential example for Terlaky's pivoting rule for the criss-cross simplex method},
  author={Kees Roos},
  journal={Mathematical Programming},
  year={1990},
  volume={46},
  pages={79-84}
}
  • Kees Roos
  • Published 1990
  • Mathematics, Computer Science
  • Mathematical Programming
Recently T. Terlaky has proposed a new pivoting rule for the criss-cross simplex method for linear programming and he proved that his rule is convergent. In this note we show that the required number of iterations may be exponential in the number of variables and constraints of the problem. 
46 Citations

Topics from this paper

The criss-cross method can take Ω(nd) pivots
On Simplex Pivoting Rules and Complexity Theory
  • 18
  • PDF
A Monotonic Build-Up Simplex Algorithm for Linear Programming
  • 30
Dual Pivot Rule
Improved Reduced Simplex Method
Criss-cross methods: A fresh view on pivot algorithms
  • 69
  • PDF
Simplex Phase-I Method
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 10 REFERENCES
New Finite Pivoting Rules for the Simplex Method
  • R. Bland
  • Mathematics, Computer Science
  • Math. Oper. Res.
  • 1977
  • 405
  • PDF
HOW GOOD IS THE SIMPLEX ALGORITHM
  • 975
Notes on Bland’s pivoting rule
  • 111
  • Highly Influential
  • PDF
Worst case behavior of the steepest edge simplex method
  • 70
The Criss-Cross Method for Solving Linear Programming Problems
  • 82
  • Highly Influential
A convergent criss-cross method
  • 94
An exponential example for Terlaky's pivoting rule for the criss-cross simplex method
  • Working paper, Delft University of Technology (Delft, 1987).
  • 1987
Combinatorial pivot rules for oriented matroid programming
  • paper presented on the 12th International Symposium on Mathematical Programming (Boston, 1985).
  • 1985