A strictly improving Phase 1 algorithm using least-squares subproblems [electronic resource]
Saved in:
| Online Access: |
Online Access |
|---|---|
| Corporate Authors: | , |
| Format: | Government Document Electronic eBook |
| Language: | English |
| Published: |
Washington, D.C. : Oak Ridge, Tenn. :
United States. Dept. of Energy ; distributed by the Office of Scientific and Technical Information, U.S. Dept. of Energy,
1992.
|
| Subjects: |
| Abstract: | Although the simplex method̀s performance in solving linear programming problems is usually quite good, it does not guarantee strict improvement at each iteration on degenerate problems. Instead of trying to recognize and avoid degenerate steps in the simplex method, we have developed a new Phase I algorithm that is completely impervious to degeneracy, with strict improvement attained at each iteration. It is also noted that the new Phase I algorithm is closely related to a number of existing algorithms. When tested on the 30 smallest NETLIB linear programming test problems, the computational results for the new Phase I algorithm were almost 3.5 times faster than the simplex method; on some problems, it was over 10 times faster. |
|---|---|
| Item Description: | Published through the Information Bridge: DOE Scientific and Technical Information. 04/01/1992. "sol--92-1" "DE92015904" ": Grant ECS-8906260" "Grant DMS-8913089" "N00014-89-J-1659" Davis, J.W.; Dantzig, G.B.; Leichner, S.A. |
| Physical Description: | 44 p. : digital, PDF file. |
| Type of Report and Period Covered Note: | Topical; |