Volume 17, Issue 3
A New Perturbation Simplex Algorithm for Linear Programming

Ping Qi Pan

J. Comp. Math., 17 (1999), pp. 233-242

Published online: 1999-06

Preview Full PDF 204 1986
Export citation
  • Abstract

In this paper,we first propose a perturbation procedure for achieving dual feasibility, which starts with any basis without introducing artificial variables. This procedure and the dual simplex method are then incorporated into a general purpose algorithm; then, a modification of it using a perturbation technique is made in order to handle highly degenerate problems efficiently. Some interesting the-oretical results are presented. Numerical results obtained are reported, which are very encouraging through still preliminary.

  • Keywords

  • AMS Subject Headings

  • Copyright

COPYRIGHT: © Global Science Press

  • Email address
  • BibTex
  • RIS
  • TXT
@Article{JCM-17-233, author = {}, title = {A New Perturbation Simplex Algorithm for Linear Programming}, journal = {Journal of Computational Mathematics}, year = {1999}, volume = {17}, number = {3}, pages = {233--242}, abstract = { In this paper,we first propose a perturbation procedure for achieving dual feasibility, which starts with any basis without introducing artificial variables. This procedure and the dual simplex method are then incorporated into a general purpose algorithm; then, a modification of it using a perturbation technique is made in order to handle highly degenerate problems efficiently. Some interesting the-oretical results are presented. Numerical results obtained are reported, which are very encouraging through still preliminary. }, issn = {1991-7139}, doi = {https://doi.org/}, url = {http://global-sci.org/intro/article_detail/jcm/9098.html} }
TY - JOUR T1 - A New Perturbation Simplex Algorithm for Linear Programming JO - Journal of Computational Mathematics VL - 3 SP - 233 EP - 242 PY - 1999 DA - 1999/06 SN - 17 DO - http://doi.org/ UR - https://global-sci.org/intro/article_detail/jcm/9098.html KW - AB - In this paper,we first propose a perturbation procedure for achieving dual feasibility, which starts with any basis without introducing artificial variables. This procedure and the dual simplex method are then incorporated into a general purpose algorithm; then, a modification of it using a perturbation technique is made in order to handle highly degenerate problems efficiently. Some interesting the-oretical results are presented. Numerical results obtained are reported, which are very encouraging through still preliminary.
Ping Qi Pan. (1970). A New Perturbation Simplex Algorithm for Linear Programming. Journal of Computational Mathematics. 17 (3). 233-242. doi:
Copy to clipboard
The citation has been copied to your clipboard