Simplex Method Algorithms Discussed

Since G.B.Dantzig proposed the simplex Method in 1947, it has always been anextremely effective calculation method for solving linear programming. But it requeststhe known basic feasible solution, so the linear programming needs the canonical expres-sion. In the common circumstances, the problems of the linear programming have no ob-vious feasible solution. If we want to obtain the basic feasible solution by two stage, wemust add the artificial variable, thus will increase computational procedures and loadin intemal storage. For the problem, we propose improved simplex method(1). By themethod, we can obtain basis feasible solution without adding artificial variables, re-move those unnecessary restraint conditions, judge whether the problem has the solu-tion or not in the solution process, and get the canonical expression simultaneously. Wepropose improved simplex method(2) for the problem of occupied very large memoryspaces, vary long computing time and large iterative number when many variables andrestraint conditions are involved. By the method, we can get the result by taking smallerstorage space, more short computing time and smaller iterative number.