A Study on the Complexity of the Simplex Method

심플렉스 기법의 복잡성에 관한 연구

We show that the complexity of Simplex Method for Linear Programming problem is equivalent to the complexity of finding just an adjacent basic feasible solution if exists. Therefore a simplex type method which resolves degeneracy in polynomial time with respect to the size of the given linear programming problem can solve the general linear programming problem in polynomial steps.