Iterative solution of linear programs. [By solving quadratic program in its dual variable space]
By perturbing a linear program to a quadratic program, it is possible to solve the latter in its dual variable space by iterative techniques such as successive over-relaxation (SOR) methods. This solution provides a solution to the original linear program. 2 tables.
- Research Organization:
- Argonne National Lab., IL (USA)
- DOE Contract Number:
- W-31109-ENG-38
- OSTI ID:
- 6130623
- Report Number(s):
- ANL-79-75
- Country of Publication:
- United States
- Language:
- English
Similar Records
Continuation methods for linear and quadratic programming
Convergence properties of iterative algorithms for solving the nodal diffusion equations
Efficient parallelization of relaxation iterative methods for solving banded linear systems on multiprocessors
Conference
·
Fri Dec 30 23:00:00 EST 1994
·
OSTI ID:36250
Convergence properties of iterative algorithms for solving the nodal diffusion equations
Conference
·
Sun Dec 31 23:00:00 EST 1989
·
OSTI ID:7222675
Efficient parallelization of relaxation iterative methods for solving banded linear systems on multiprocessors
Conference
·
Thu Nov 30 23:00:00 EST 1995
·
OSTI ID:125557