A Discussion of the Saddle Point Algorithm for Large Scale LP Problems
DOI:
CSTR:
Author:
Affiliation:
Clc Number:
Fund Project:
Article
|
Figures
|
Metrics
|
Reference
|
Related
|
Cited by
|
Materials
|
Comments
Abstract:
This paper discusses an extremely rapid algorithm for lincar programming whích ís based upon the direct approach to the saddle point of the Lagrangean. The algoríthm appears particularly well suited for problems of high dimensions and with a sígnificant numbers of non zero elements.
