The decomposition principle and algorithms for linear programming (Q806964): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| 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 | |||
| Property / cites work | |||
| Property / cites work: Q4079613 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3844775 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The Decomposition Algorithm for Linear Programs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5583564 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4040713 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Mathematics in economics: Achievements, difficulties, perspectives / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A new polynomial-time algorithm for linear programming / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4051879 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3786267 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3694577 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5680669 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3947447 / rank | |||
Normal rank | |||
Latest revision as of 17:47, 21 June 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
