The decomposition principle and algorithms for linear programming (Q806964)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The decomposition principle and algorithms for linear programming |
scientific article; zbMATH DE number 4205886
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The decomposition principle and algorithms for linear programming |
scientific article; zbMATH DE number 4205886 |
Statements
The decomposition principle and algorithms for linear programming (English)
0 references
1991
0 references
The paper deals with the computational difficulties encountered in the Dantzig-Wolfe decomposition algorithm. The DKN-algorithm is proposed. Numerical experiments are given, which illustrate this procedure, and computational results are described. The DKN-algorithm is exemplified by further discussion of the case of decentralized decision.
0 references
linear programming
0 references
Dantzig-Wolfe decomposition algorithm
0 references
DKN-algorithm
0 references
Numerical experiments
0 references
computational results
0 references
decentralized decision
0 references
0.8343172073364258
0 references
0.8307204842567444
0 references
0.8265674114227295
0 references
0.8250327706336975
0 references
