Notes on Bland’s pivoting rule

@inproceedings{Avis1978NotesOB,
  title={Notes on Bland’s pivoting rule},
  author={Davis Avis and V. Chv{\'a}tal},
  year={1978}
}
Recently R.G. Bland proposed two new rules for pivot selection in the simplex method. These elegant rules arise from Bland’s work on oriented matroids; their virtue is that they never lead to cycling. We investigate the efficiency of the first of them. On randomly generated problems with 50 nonnegative variables and 50 additional inequalities, Bland’s rule requires about 400 iterations on the average; the corresponding figure for the popular “largest coefficient” rule is only about 100… Expand

Tables from this paper

Pivot rules for linear programming: A survey on recent theoretical developments
An Exponential Lower Bound for Zadeh's pivot rule
On Friedmann's Subexponential Lower Bound for Zadeh's Pivot Rule
On Simplex Pivoting Rules and Complexity Theory
An exponential example for Terlaky's pivoting rule for the criss-cross simplex method
  • Kees Roos
  • Mathematics, Computer Science
  • Math. Program.
  • 1990
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 11 REFERENCES
HOW GOOD IS THE SIMPLEX ALGORITHM
The simplex algorithm with the pivot rule of maximizing criterion improvement
  • R. Jeroslow
  • Computer Science, Mathematics
  • Discret. Math.
  • 1973
New Finite Pivoting Rules for the Simplex Method
  • R. Bland
  • Mathematics, Computer Science
  • Math. Oper. Res.
  • 1977
Cycling in the dual simplex algorithm
The simplex algorithm with the pivot rule of maximizing improvement criterion
  • Discrete Mathematics
  • 1973
Experimental Arithmetic, High Speed Computing and Mathematics
Optimality and Degeneracy in Linear Programming
...
1
2
...