An algorithm for simplex tableau reduction: The push-to-pull solution strategy
This paper proposes a new general solution algorithm. The algorithm consists of preliminaries, followed by two main phases. The first phase develops a basic variable set, the second phase pulls the solution back to feasibility. Both phases use the usual Gauss pivoting row operation. Some numerical examples illustrate different parts of the new solution algorithm. Also a computer implementation of the algorithm is given.
scientific article; zbMATH DE number 1977978