bokomslag DECOMP: an Implementation of Dantzig-Wolfe Decomposition for Linear Programming
Data & IT

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

James K Ho Rangaraja P Sundarraj

Pocket

759:-

Funktionen begränsas av dina webbläsarinställningar (t.ex. privat läge).

Uppskattad leveranstid 10-16 arbetsdagar

Fri frakt för medlemmar vid köp för minst 249:-

  • 206 sidor
  • 1989
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.
  • Författare: James K Ho, Rangaraja P Sundarraj
  • Format: Pocket/Paperback
  • ISBN: 9780387971544
  • Språk: Engelska
  • Antal sidor: 206
  • Utgivningsdatum: 1989-11-01
  • Förlag: Springer-Verlag New York Inc.