MetaCartSign in to MyCiteSeer

Include Citations | Advanced Search | Help

Include Citations | Advanced Search | Help

  Econometric Institute Report No. 9707/A NEW VARIANTS OF FINITE CRISS-CROSS PIVOT ALGORITHMS FOR LINEAR PROGRAMMING

Download:
Download as a PDF
by Shuzhong Zhang
http://www.eur.nl/WebDOC/doc/econometrie/eeb19960111120055.pdf
Add To MetaCart

Abstract:

In this paper we generalize the so-called rst-in-last-out pivot rule and the most-often-selected-variable pivot rule for the simplex method, as proposed in Zhang [13], to the criss-cross pivot setting where neither the primal nor the dual feasibility is preserved. The nite-ness of the new criss-cross pivot variants is proven.

Citations

21 Oriented matroid programming – Fukuda - 1982
19 A convergent criss-cross method – Terlaky - 1985
17 A finite criss-cross method for oriented matroids – Terlaky - 1987
15 and T.Terlaky, Criss-cross methods: A fresh view on pivot algorithms – Fukuda - 1997
10 The criss-cross method for solving linear programming problems, Management Science 15(7 – Zionts - 1969
8 Least index resolution of degeneracy in linear complementarity problems – Chang - 1979
8 The existence of a short sequence of admissible pivots to an optimal basis – Fukuda, Luthi, et al. - 1997
6 On the finiteness of the criss-cross method – Fukuda, Matsui - 1991
6 Pivot rules for linear programming: a survey on recent theoretical developments – Terlaky, Zhang - 1993
5 On anti-cycling pivoting rules for the simplex method – Zhang - 1991
4 New nite pivoting rules for the simplex method – Bland - 1977
1 Coloring and duality: Combinatorial augumentation methods – Jensen - 1985
1 Aconformal elimination-free algorithm for oriented matroid programming – Wang - 1987
View or Download | Add to My Collection | Correct Errors