@Article{JICS-13-195,
author = {Xiangrui Meng, Wenya Gu and Pingqi Pan},
title = {Primal-dual Simplex Algorithm for Linear Programming},
journal = {Journal of Information and Computing Science},
year = {2018},
volume = {13},
number = {3},
pages = {195--200},
abstract = {1School of Binjiang, Nanjing University of Information Science & Technology, Nanjing 210044, China 
2Department of Mathematics, Southeast University, Nanjing 210000, China 
(Received March 03 2018, accepted August 19 2018) 
When the linear programming (LP) problem satisfies neither the primal feasibility nor the dual feasibility, 
the primal-dual simplex method can be used to solve the problem in order to avoid the defect of the increase of decision 
variables  caused  by  the  addition  of  artificial  variables  in  the  two-stage  algorithm.  In  this  paper,  we  use  PPSM 
(primitive - primitive simplex method) and DDSM(dual - dual simplex method) to solve these problems. Compared 
with the simplex method of two-stages, a better result is obtained. 
},
issn = {3080-180X},
doi = {https://doi.org/},
url = {http://global-sci.org/intro/article_detail/jics/22445.html}
}