A New Iterative Algorithm for Linear Programming Based on Direct Saddle Point Convergence

This paper proposes a fast algorithm for linear programming which is based on direct approach to the saddle point of the Lagrangean. The algorithm appears particularly well suited for problems of high dimension and problems with great numbers of nonzero elements. Computational experience with the algorithm suggests that it converges much faster than the simplex method.