The decomposition principle and algorithms for linear programming (Q806964): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0024-3795(91)90270-7 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2072867904 / rank | |||
Normal rank | |||
Revision as of 23:22, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The decomposition principle and algorithms for linear programming |
scientific article |
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
