2M. Soleimani-damaneh.Modified big-M method to recognize the infeasibility of linear programming models[J].Knowledge-Based Systems.2008(5)
3Wei Li,P. Guerrero-García,A. Santos-Palomo.A basis-deficiency-allowing primal phase-I algorithm using the most-obtuse-angle column rule[J].Computers and Mathematics with Applications.2006(6)
4Ping-Qi Pan.A phase-1 approach for the generalized simplex algorithm[J].Computers and Mathematics with Applications.2001(10)
5P.-Q. Pan.A basis-deficiency-allowing variation of the simplex method for linear programming[J].Computers and Mathematics with Applications.1998(3)
6Ping -Qi Pan.Practical finite pivoting rules for the simplex method[J].OR Spektrum.1990(4)
7George B. Dantzig,Alex Orden,Philip Wolfe.The generalized simplex method for minimizing a linear form under linear inequality restraints[].Pacific Journal of Mathematics.1955
8Bland,R.G.New finite pivoting rules for the simplex method[].Mathematics of Operations Research.1977
