DECOMP: an Implementation of Dantzig-Wolfe Decomposition for Linear Programming
For linear optimization models that can be formulated as linear programs with the block-angular structure, i.e. independent subproblems with coupling constraints, the Dantzig-Wolfe decomposition principle provides an elegant framework of solution algorithms as well as economic interpretation. This m...
| Main Authors: | , |
|---|---|
| Format: | eBook |
| Language: | English |
| Published: |
New York, NY
Springer New York
1989, 1989
|
| Edition: | 1st ed. 1989 |
| Series: | Lecture Notes in Economics and Mathematical Systems
|
| Subjects: | |
| Online Access: | |
| Collection: | Springer Book Archives -2004 - Collection details see MPG.ReNa |
| Summary: | For linear optimization models that can be formulated as linear programs with the block-angular structure, i.e. independent subproblems with coupling constraints, the Dantzig-Wolfe decomposition principle provides an elegant framework of solution algorithms as well as economic interpretation. This monograph is the complete documentation of DECOMP: a robust implementation of the Dantzig-Wolfe decomposition method in FORTRAN. The code can serve as a very convenient starting point for further investigation, both computational and economic, of parallelism in large-scale systems. It can also be used as supplemental material in a second course in linear programming, computational mathematical programming, or large-scale systems |
|---|---|
| Physical Description: | VI, 206 p online resource |
| ISBN: | 9781468493979 |