A note on the Edmonds-Fukuda pivoting rule for simplex algorithms
The pivot rule of Edmonds-Fukuda for simplex algorithms is discussed. A proof is given that this rule maintains feasibility of the solution during the solution process. The relation to the recursive ``rule II''- method of \textit{R. G. Bland} [Math. Oper. Res. 2, 103-107 (1977; Zbl 0408.90050)] is discussed. As the author remarks this pivoting rule (presumably) is not so effective as the classical Dantzig pivoting rule for non-degenerate problems.
scientific article; zbMATH DE number 4027165