Multistage stochastic programs, which involve sequences of decisions over time, are usually hard to solve in realistically sized problems. Providing bounds for optimal solution may help in evaluating whether it is worth the additional computations for the stochastic program vs. simplified approaches. In this paper we generalize measures from the two-stage case, based on different levels of available information, to the multistage stochastic programming problems. A set of theorems providing chains of inequalities among the new quantities are proved. Numerical results on a case study related to a simple transportation problem illustrate the described relationships
We propose a stochastic model for the daily operation scheduling of a generation system including pumped storage hydro plants and wind power plants, where the uncertainty is represented by the hourly wind power production. In order to assess the value of the stochastic modeling, we discuss two case studies: in the former the scenario tree is built so as to include both low and high wind power production scenarios, in the latter the scenario tree is built on historical wind speed data covering a time span of one and a half year. The Value of the Stochastic Solution, computed by a modified new procedure, shows that in scenarios with low wind power production the stochastic solution allows the producer to obtain a profit which is greater than the one associated to the deterministic solution. In-sample stability of the optimal function values for increasing number of scenarios is reported.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.