Volume 28, Issue 6
A Fast Simplex Algorithm for Linear Programming

Pingqi Pan

J. Comp. Math., 28 (2010), pp. 837-847.

Published online: 2010-12

Preview Full PDF 279 1985
Export citation
  • Abstract

Recently, computational results demonstrated remarkable superiority of a so-called "largest-distance" rule and "nested pricing" rule to other major rules commonly used in practice, such as Dantzig'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.

  • Keywords

Large-scale linear programming, Simplex algorithm, Pivot rule, Nested, Largest-distance, Scaling.

  • AMS Subject Headings

65K05, 90C05.

  • Copyright

COPYRIGHT: © Global Science Press

  • Email address
  • BibTex
  • RIS
  • TXT
@Article{JCM-28-837, author = {}, title = {A Fast Simplex Algorithm for Linear Programming}, journal = {Journal of Computational Mathematics}, year = {2010}, volume = {28}, number = {6}, pages = {837--847}, abstract = {

Recently, computational results demonstrated remarkable superiority of a so-called "largest-distance" rule and "nested pricing" rule to other major rules commonly used in practice, such as Dantzig'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.

}, issn = {1991-7139}, doi = {https://doi.org/10.4208/jcm.3105-m2897}, url = {http://global-sci.org/intro/article_detail/jcm/8553.html} }
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 -

Recently, computational results demonstrated remarkable superiority of a so-called "largest-distance" rule and "nested pricing" rule to other major rules commonly used in practice, such as Dantzig'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.

Pingqi Pan. (1970). A Fast Simplex Algorithm for Linear Programming. Journal of Computational Mathematics. 28 (6). 837-847. doi:10.4208/jcm.3105-m2897
Copy to clipboard
The citation has been copied to your clipboard