New variants of finite criss-cross pivot algorithms for linear programming

@article{Zhang1999NewVO,
  title={New variants of finite criss-cross pivot algorithms for linear programming},
  author={Shuzhong Zhang},
  journal={Eur. J. Oper. Res.},
  year={1999},
  volume={116},
  pages={607-614}
}
  • Shuzhong Zhang
  • Published 1999
  • Mathematics, Computer Science
  • Eur. J. Oper. Res.
In this paper we generalize the so-called first-in-last-out pivot rule and the most-often-selected-variable pivot rule for the simplex method, as proposed in Zhang \\cite{Z91}, to the criss-cross pivot setting where neither the primal nor the dual feasibility is preserved. The finiteness of the new criss-cross pivot variants is proven. 
Criss-cross methods: A fresh view on pivot algorithms
The s-monotone index selection rules for pivot algorithms of linear programming
Performance evaluation of a family of criss–cross algorithms for linear programming
Pivot versus interior point methods: Pros and cons
A new non-monotonic infeasible simplex-type algorithm for Linear Programming
The Improvement on R. G. Bland’s Method
...
1
2
3
...

References

SHOWING 1-10 OF 18 REFERENCES
...
1
2
...