Aggregation bounds in stochastic linear programming (Q3675909)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3896669
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Aggregation bounds in stochastic linear programming |
scientific article; zbMATH DE number 3896669 |
Statements
Aggregation bounds in stochastic linear programming (English)
0 references
1985
0 references
random right-hand side
0 references
multi-stage stochastic linear programs
0 references
Error bounds
0 references
aggregations
0 references
0 references
0.8491021394729614
0 references
0.8427019715309143
0 references
0.8305545449256897
0 references
0.8305545449256897
0 references
This paper considers multi-stage stochastic linear programs in which the right-hand side vectors are random. Methods are given for aggregating rows and columns of these extremely large problems. One of these aggregation procedures occurs within a period and amounts to taking expected values or conditional expected values of the random vectors. The other aggregation collapses several periods together into a single period. Error bounds are derived for these two aggregations on the optimal value of the original problem.
0 references