The criss-cross method can take Ω(nd) pivots

Authors:
Bohdan Kaluzny;Komei Fukuda
Affiliations:
McGill University, Montreal, Canada;ETH Zentrum, Zurich, Switzerland
Venue:
SCG '04 Proceedings of the twentieth annual symposium on Computational geometry
Year:
2004

Citing 2
Cited 0

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

Mathematical Programming: Series A and B
Oriented matroids

Handbook of discrete and computational geometry

Quantified Score

Hi-index	0.00

Visualization

Abstract

Using deformed products of arrangements, we construct a family of linearprograms with n inequalities in Rd on which, in the worst-case, the least-index criss-cross methodrequires Ω(nd) (for fixed d) pivots to reach optimality.