New variants of finite criss-cross pivot algorithms for linear programming
January 1997
Research Paper
This publication is part of collection
| Related Files |
|---|
View PDF Version
(eeb19960111120055.pdf, 0.2MB) |
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.
Keywords
Automatically Extracted Terms
- algorithm
- basis
- method
- basis b
- problem
- programming
- simplex method
- j 2 n
- basis b 0
- variant
- terlaky
- 4.1
- variable
- theorem
- lemma 4.1
- simplex
- nitenes
- k 2 j
- k 2 i
- iteration
