Accelerated simplex method

摘要

This paper introduces a new so-called accelerated simplex method (ASM) for solving general linear programming problems. Instead of previous simplex method (SM) using one-dimensional border linear iteration along feasible solution set, ASM adopts two-dimensional border plane iteration. Therefore, in theory, SM can be viewed as a special case of ASM. Numerical experiment results indicate that in the case m ≥ 200, n ≥ 20, ASM has significant advantage over SM iterated by Bland rule in terms of iterative steps and iterative time.