Wonder Club world wonders pyramid logo
×

Decomp: An Implementation of Dantzig-Wolfe Decomposition for Linear Programming Book

Decomp: An Implementation of Dantzig-Wolfe Decomposition for Linear Programming
Be the First to Review this Item at Wonderclub
X
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 algorith, Decomp: An Implementation of Dantzig-Wolfe Decomposition for Linear Programming
out of 5 stars based on 0 reviews
5
0 %
4
0 %
3
0 %
2
0 %
1
0 %
Digital Copy
PDF format
1 available   for $99.99
Original Magazine
Physical Format

Sold Out

  • Decomp: An Implementation of Dantzig-Wolfe Decomposition for Linear Programming
  • Written by author James K. Ho, R.P. Dundarraj
  • Published by Springer, 1989/10/25
  • 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 algorith
Buy Digital  USD$99.99

WonderClub View Cart Button

WonderClub Add to Inventory Button
WonderClub Add to Wishlist Button
WonderClub Add to Collection Button

Book Categories

Authors

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.


Login

  |  

Complaints

  |  

Blog

  |  

Games

  |  

Digital Media

  |  

Souls

  |  

Obituary

  |  

Contact Us

  |  

FAQ

CAN'T FIND WHAT YOU'RE LOOKING FOR? CLICK HERE!!!

X
WonderClub Home

This item is in your Wish List

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 algorith, Decomp: An Implementation of Dantzig-Wolfe Decomposition for Linear Programming

X
WonderClub Home

This item is in your Collection

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 algorith, Decomp: An Implementation of Dantzig-Wolfe Decomposition for Linear Programming

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

X
WonderClub Home

This Item is in Your Inventory

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 algorith, Decomp: An Implementation of Dantzig-Wolfe Decomposition for Linear Programming

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

WonderClub Home

You must be logged in to review the products

E-mail address:

Password: