In general, multistage stochastic optimization problems are formulated on the basis of continuous distributions describing the uncertainty. Such “infinite” problems are practically impossible to solve as they are formulated, and finite tree approximations of the underlying stochastic processes are used as proxies. In this paper, we demonstrate how one can find guaranteed bounds, i.e., finite tree models, for which the optimal values give upper and lower bounds for the optimal value of the original infinite problem. Typically, there is a gap between the two bounds. However, this gap can be made arbitrarily small by making the approximating trees bushier. We consider approximations in the first-order stochastic sense, in the convex-order sense, and based on subgradient approximations. Their use is shown in a multistage risk-averse production problem.

(2019). Guaranteed Bounds for General Nondiscrete Multistage Risk-Averse Stochastic Optimization Programs [journal article - articolo]. In SIAM JOURNAL ON OPTIMIZATION. Retrieved from http://hdl.handle.net/10446/134539

Guaranteed Bounds for General Nondiscrete Multistage Risk-Averse Stochastic Optimization Programs

Maggioni, Francesca;
2019-01-01

Abstract

In general, multistage stochastic optimization problems are formulated on the basis of continuous distributions describing the uncertainty. Such “infinite” problems are practically impossible to solve as they are formulated, and finite tree approximations of the underlying stochastic processes are used as proxies. In this paper, we demonstrate how one can find guaranteed bounds, i.e., finite tree models, for which the optimal values give upper and lower bounds for the optimal value of the original infinite problem. Typically, there is a gap between the two bounds. However, this gap can be made arbitrarily small by making the approximating trees bushier. We consider approximations in the first-order stochastic sense, in the convex-order sense, and based on subgradient approximations. Their use is shown in a multistage risk-averse production problem.
articolo
2019
Maggioni, Francesca; Pflug, Georg Ch.
(2019). Guaranteed Bounds for General Nondiscrete Multistage Risk-Averse Stochastic Optimization Programs [journal article - articolo]. In SIAM JOURNAL ON OPTIMIZATION. Retrieved from http://hdl.handle.net/10446/134539
File allegato/i alla scheda:
File Dimensione del file Formato  
M114060revise.pdf

accesso aperto

Descrizione: SIAM content, including journals, books and proceedings, is subject to copyright, database protections, and other rights of the publisher (SIAM) under the laws of the United States and the country of use. User acknowledges that they have no claim to ownership by reason of their use of or access to the SIAM platform. Downloading or photocopying of the content is permitted for personal or educational use to the same extent as the print edition of the publication
Versione: postprint - versione referata/accettata senza referaggio
Licenza: Licenza default Aisberg
Dimensione del file 1.49 MB
Formato Adobe PDF
1.49 MB Adobe PDF Visualizza/Apri
17M1140601.pdf

Solo gestori di archivio

Versione: publisher's version - versione editoriale
Licenza: Licenza default Aisberg
Dimensione del file 1.5 MB
Formato Adobe PDF
1.5 MB Adobe PDF   Visualizza/Apri
Pubblicazioni consigliate

Aisberg ©2008 Servizi bibliotecari, Università degli studi di Bergamo | Terms of use/Condizioni di utilizzo

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/10446/134539
Citazioni
  • Scopus 12
  • ???jsp.display-item.citation.isi??? 12
social impact