๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

New algorithms for linear programming

โœ Scribed by Shiquan Wu; Fang Wu

Publisher
Institute of Applied Mathematics, Chinese Academy of Sciences and Chinese Mathematical Society
Year
1992
Tongue
English
Weight
364 KB
Volume
8
Category
Article
ISSN
0168-9673

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

New variants of finite criss-cross pivot
New variants of finite criss-cross pivot algorithms for linear programming
โœ Shuzhong Zhang ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 106 KB

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