In this paper, a modification of the bisection simplex method is made for more general purpose use. Organized in an alternative simpler form, the modified version exploits information of the optimal ...

The paper presents a method for solving the linear programming problems, which is itself a step towards the generalization of the classical Simlex Method. It replaces two basic variables by two ...

About the same time, he invented the “simplex method,” an algorithm for solving linear programming problems.

The book also addresses linear programming duality theory and its use in algorithm design as well as the Dual Simplex Method, Dantzig-Wolfe decomposition, and a primal-dual interior point algorithm.

Perold, André. "Exploiting Degeneracy in the Simplex Method." In Large Scale Linear Programming, edited by G. B. Dantzig, M. A. H. Dempster, and Markku Kallio ...