@Article{JCM-18-6,
author = {Ping-Qi, Pan},
title = {Primal Perturbation Simplex Algorithms for Linear Programming},
journal = {Journal of Computational Mathematics},
year = {2000},
volume = {18},
number = {6},
pages = {587--596},
abstract = {<p style="text-align: justify;">In this paper, we propose two new perturbation simplex variants. Solving linear programming problems without introducing artificial variables, each of the two uses the dual pivot rule to achieve primal feasibility, and then the primal pivot rule to achieve optimality. The second algorithm, a modification of the first, is designed to handle highly degenerate problems more efficiently. Some interesting results concerning merit of the perturbation are established. Numerical results from preliminary tests are also reported. &nbsp;</p>},
issn = {1991-7139},
doi = {https://doi.org/2000-JCM-9069},
url = {https://global-sci.com/article/85583/primal-perturbation-simplex-algorithms-for-linear-programming}
}