@Article{JCM-17-3,
author = {Ping-Qi, Pan},
title = {A New Perturbation Simplex Algorithm for Linear Programming},
journal = {Journal of Computational Mathematics},
year = {1999},
volume = {17},
number = {3},
pages = {233--242},
abstract = {<p style="text-align: justify;">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 theoretical results are presented. Numerical results obtained are reported, which are very encouraging through still preliminary. &nbsp;</p>},
issn = {1991-7139},
doi = {https://doi.org/1999-JCM-9098},
url = {https://global-sci.com/article/85617/a-new-perturbation-simplex-algorithm-for-linear-programming}
}