Template-Type: ReDIF-Paper 1.0
Author-Name: Zhang, S.
Author-Name-Last: Zhang
Author-Name-First: Shuzhong
Title: New variants of finite criss-cross pivot algorithms for linear programming
Abstract: 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.
Creation-Date: 1997-01-01
File-URL: https://repub.eur.nl/pub/1419/eeb19960111120055.pdf
File-Format: application/pdf
Series: RePEc:ems:eureir
Number: EI 9707-/A
Keywords: anti-cycling, criss-cross pivot method, linear programming
Handle: RePEc:ems:eureir:1419