Consider (typically large) multistage stochastic programs, which are defined on scenario trees as the basic data structure. It is well known that the computational complexity of the solution depends on the size of the tree, which itself increases typically exponentially fast with its height, i.e., the number of decision stages. For this reason approximations which replace the problem by a simpler one and allow bounding the optimal value are of great importance. In this paper we study several methods to obtain lower and upper bounds for multistage stochastic programs and we demonstrate their use in a multistage inventory problem.
(2016). Bounds and approximations for multistage stochastic programs [journal article - articolo]. In SIAM JOURNAL ON OPTIMIZATION. Retrieved from http://hdl.handle.net/10446/76191
Bounds and approximations for multistage stochastic programs
MAGGIONI, Francesca;
2016-01-01
Abstract
Consider (typically large) multistage stochastic programs, which are defined on scenario trees as the basic data structure. It is well known that the computational complexity of the solution depends on the size of the tree, which itself increases typically exponentially fast with its height, i.e., the number of decision stages. For this reason approximations which replace the problem by a simpler one and allow bounding the optimal value are of great importance. In this paper we study several methods to obtain lower and upper bounds for multistage stochastic programs and we demonstrate their use in a multistage inventory problem.File | Dimensione del file | Formato | |
---|---|---|---|
Maggioni - Bounds and approximations for multistage stochastic programs.pdf
accesso aperto
Versione:
publisher's version - versione editoriale
Licenza:
Licenza default Aisberg
Dimensione del file
509.31 kB
Formato
Adobe PDF
|
509.31 kB | Adobe PDF | Visualizza/Apri |
Pubblicazioni consigliate
Aisberg ©2008 Servizi bibliotecari, Università degli studi di Bergamo | Terms of use/Condizioni di utilizzo