TY - JOUR T1 - A New Perturbation Simplex Algorithm for Linear Programming AU - Pan , Ping-Qi 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 - Linear programming, Simplex method, Perturbation, Dual feasibility. 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 theoretical results are presented. Numerical results obtained are reported, which are very encouraging through still preliminary.