NobleBlocks
Public

A simplex algorithm---gradient projection method for nonlinear programming

Published • Jan 1, 1971
Authors:
L. Duane Pyle

Abstract

Witzgall [8], commenting on the gradient projection methods of R. Frisch and J. B. Rosen, states: “More or less all algorithms for solving the linear programming problem are known to be modifications of an algorithm for matrix inversion. Thus the simplex method corresponds to the Gauss-Jordan method...

Finding related papers...

Discussions

(0)

No comments yet

Be the first to share your thoughts!