LIFT: a nested decomposition algorithm for solving lower block triangular linear programs. Report AMD-859. [In PL/I for IBM 370]
Conference
·
OSTI ID:5271172
Nested decomposition of linear programs is the result of a multilevel, hierarchical application of the Dantzig-Wolfe decomposition principle. The general structure is called lower block-triangular, and permits direct accounting of long-term effects of investment, service life, etc. LIFT, an algorithm for solving lower block triangular linear programs, is based on state-of-the-art modular LP software. The algorithmic and software aspects of LIFT are outlined, and computational results are presented. 5 figures, 6 tables. (RWR)
- Research Organization:
- Erasmus Univ., Rotterdam (Netherlands); Brookhaven National Lab., Upton, NY (USA); Universite Catholique de Louvain, Louvain-la-Neuve (Belgium)
- Sponsoring Organization:
- USDOE
- DOE Contract Number:
- AC02-76CH00016
- OSTI ID:
- 5271172
- Report Number(s):
- BNL-28070; CONF-800687-1
- Resource Relation:
- Conference: Workshop on large-scale linear programming, Laxenburg, Austria, 2 Jun 1980
- Country of Publication:
- United States
- Language:
- English
Similar Records
Advances in a nested decomposition algorithm for solving staircase linear programs. Technical report SOL 83-2
Linear programs for multistage production scheduling: Some computational aspects
LP and NLP decomposition without a master problem
Technical Report
·
Tue Mar 01 00:00:00 EST 1983
·
OSTI ID:5271172
Linear programs for multistage production scheduling: Some computational aspects
Conference
·
Sat Dec 31 00:00:00 EST 1994
·
OSTI ID:5271172
LP and NLP decomposition without a master problem
Conference
·
Sat Dec 31 00:00:00 EST 1994
·
OSTI ID:5271172