DECOMP: An Implementation of Dantzig-Wolfe Decomposition for Linear Programming
TENNESSEE UNIV KNOXVILLE
Pagination or Media Count:
The tasks accomplished as of December 1, 1989 are A Completion of a monograph entitled DECOMP an Implementation of Dantzig-Wolfe Decomposition for Linear Programming BImplementation of DECUBE, a linear programming decomposition code in Fortran on an Intel iPSC2 Hypercube computer with 64 processors C Analysis and empirical study of computational strategies and the dynamics of information in parallel decomposition. Results were presented at the ORSATIMS Joint National Meeting in Vancouver, B.C., Canada in May 1989 D The multistage, multiproduct material requirements planning problem with capacity constraints.Results were presented problem. Initial results on the application of a nested decomposition algorithm using parallel computation were decomposition algorithm using parallel computation were presented at the Joint USA-Italy Workshop on Urban Traffic Networks in Capri, Italy in June 1989.
- Operations Research