New variants of finite criss-cross pivot algorithms for linear programming

✍ Scribed by Shuzhong Zhang

• Publisher: Elsevier Science
• Year: 1999
• Tongue: English
• Weight: 106 KB
• Volume: 116
• Category: Article
• ISSN: 0377-2217
• DOI: 10.1016/s0377-2217(98)00026-5

✦ Synopsis

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 S. Zhang (Operations Research Letters 10 (1991) 189±192) to the criss-cross pivot setting where neither the primal nor the dual feasibility is preserved. The ®niteness of the new criss-cross pivot variants is proven.