New Finite Pivoting Rules for the Simplex Method

@article{Bland1977NewFP,
  title={New Finite Pivoting Rules for the Simplex Method},
  author={R. Bland},
  journal={Math. Oper. Res.},
  year={1977},
  volume={2},
  pages={103-107}
}
  • R. Bland
  • Published 1977
  • Mathematics, Computer Science
  • Math. Oper. Res.
A simple proof of finiteness is given for the simplex method under an easily described pivoting rule. A second new finite version of the simplex method is also presented. 
408 Citations

Topics from this paper

On anti-cycling pivoting rules for the simplex method
An exponential example for Terlaky's pivoting rule for the criss-cross simplex method
  • Kees Roos
  • Mathematics, Computer Science
  • Math. Program.
  • 1990
An exterior point simplex algorithm for (general) linear programming problems
Dual Pivot Rule
New variants of finite criss-cross pivot algorithms for linear programming
Improved Reduced Simplex Method
Efficient nested pricing in the simplex algorithm
  • Pingqi Pan
  • Mathematics, Computer Science
  • Oper. Res. Lett.
  • 2008
A new pivoting rule for solving various degeneracy problems
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 10 REFERENCES
The Elementary Vectors of a Subspace of RiY
Orientability of matroids
Linear programming and extensions
Oriented Matroids. Dissertation, University of Washington
  • 1975
Complementary Orthogonal Subspaces of R" and Orientability of Matroids
  • 1974
Complementary Orthogonal Subspaces of R n and Orientability of Matroids
  • 1974
Matroides Orientables, (preprint)
  • Announced in C. R. Acad. Sci. Paris,
  • 1974
Matroides Orientables, ereprint)
  • Announced in C . R.Acad. Sci. Paris,
  • 1974
Matroides Orientables, ereprint) Announced in
  • C . R.Acad. Sci. Paris
  • 1974
Combinatorial Mathemaiics and Its Applications
  • Combinatorial Mathemaiics and Its Applications