A multicut algorithm for two-stage stochastic linear programs (Q1104862): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 03:14, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A multicut algorithm for two-stage stochastic linear programs |
scientific article |
Statements
A multicut algorithm for two-stage stochastic linear programs (English)
0 references
1988
0 references
Algorithms for solving deterministic equivalents of two-stage stochastic linear programming problems with fixed recourse are considered. The authors propose to use the multicut L-shaped algorithm which needs not such a large number of iterations as the L-shaped algorithm [see \textit{R. M. Van Slyke} and \textit{R. Wets}, SIAM J. Appl. Math. 17, 638-663 (1969; Zbl 0197.456)]. The maximum number of iterations for both algorithms are found and the simple recourse problem is considered separately. Finally, results of numerical experiments are reviewed and two examples are presented.
0 references
deterministic equivalents
0 references
two-stage stochastic linear programming
0 references
fixed recourse
0 references
multicut L-shaped algorithm
0 references
