DECOMP: An Implementation of Dantzig-Wolfe Decomposition for Linear Programming

Abstract

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; B)Implementation of DECUBE, a linear programming decomposition code in Fortran on an Intel iPSC/2 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 ORSA/TIMS 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.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jan 01, 1989
Accession Number
ADA218223

Entities

Organizations

  • University of Tennessee system

Tags

DTIC Thesaurus Topics

  • Algorithms
  • Computations
  • Computer Programming
  • Computers
  • Decomposition
  • Linear Programming
  • Materials
  • Mathematical Programming
  • Networks
  • New York
  • Operations Management
  • Operations Research
  • Optimization
  • Parallel Computing
  • Parallel Processing
  • Simplex Method

Readers

  • Academic Conference Management
  • Operations Research
  • Parallel and Distributed Computing.