A note on the Edmonds-Fukuda pivoting rule for simplex algorithms (Q1095028)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A note on the Edmonds-Fukuda pivoting rule for simplex algorithms |
scientific article; zbMATH DE number 4027165
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A note on the Edmonds-Fukuda pivoting rule for simplex algorithms |
scientific article; zbMATH DE number 4027165 |
Statements
A note on the Edmonds-Fukuda pivoting rule for simplex algorithms (English)
0 references
1987
0 references
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.
0 references
cycling
0 references
stalling
0 references
pivot rule of Edmonds-Fukuda
0 references
simplex algorithms
0 references
0.87714744
0 references
0.8757676
0 references
0.8684728
0 references
0.8672734
0 references
0.8669907
0 references
0.86626565
0 references
