TY - JOUR
T1 - A Fast Simplex Algorithm for Linear Programming
JO - Journal of Computational Mathematics
VL - 6
SP - 837
EP - 847
PY - 2010
DA - 2010/12
SN - 28
DO - http://doi.org/10.4208/jcm.3105-m2897
UR - https://global-sci.org/intro/article_detail/jcm/8553.html
KW - Large-scale linear programming, Simplex algorithm, Pivot rule, Nested, Largest-distance, Scaling.
AB - <p style="text-align: justify;">Recently, computational results demonstrated remarkable superiority of a so-called &quot;largest-distance&quot; rule and &quot;nested pricing&quot; rule to other major rules commonly used in practice, such as Dantzig&#39;s original rule, the steepest-edge rule and Devex rule. Our computational experiments show that the simplex algorithm using a combination of these rules turned out to be even more efficient.</p>