Nested-decomposition approach for solving staircase linear programs
The Nested Decomposition Principle of Manne and Ho is applied to the dual of a T-period staircase linear program, generating a sequence of one-period problems. These problems are coordinated only through communication of price and activity information between adjacent periods; an optimal coordination is achieved after repeated solution of the individual problems. The duals of the one-period problems reflect more naturally the structure of the primal problem. In this setting, a modified algorithm is developed which accelerates convergence by parametrizing the information exchanged between periods. Typically, information is provided to period t from previous and subsequent periods in the form of surrogate columns and modified right-hand side, and surrogate rows and modified cost coefficients, respectively. This algorithm may be implemented either by using existing linear programming software to solve the one-period problems, or through the use of data structures specifically adapted to this approach. Update formulas for such data structures are given and computational strategies which further accelerate convergence are discussed.
- Research Organization:
- Stanford Univ., CA (USA). Dept. of Operations Research
- DOE Contract Number:
- AT03-76ER72018
- OSTI ID:
- 6028182
- Report Number(s):
- SOL-83-4; ON: DE83013560
- Country of Publication:
- United States
- Language:
- English
Similar Records
Time-staged linear programs
Time-staged linear programs. Technical report SOL 80-28