Multistage stochastic optimization requires the definition and the generation of a discrete stochastic tree that represents the evolution of the uncertain parameters in time and space. The dimension of the tree is the result of a trade-off between the adaptability to the original probability distribution and the computational tractability. Moreover, the discrete approximation of a continuous random variable is not unique. The concept of the best discrete approximation has been widely explored and many enhancements to adjust and fix a stochastic tree in order to represent as well as possible the real distribution have been proposed. Yet, often, the same generation algorithm can produce multiple trees to represent the random variable. Therefore, the recent literature investigates the concept of distance between trees which are candidate to be adopted as stochastic framework for the multistage model optimization. The contribution of this paper is to compute the nested distance between a large set of multistage and multivariate trees and, for a sample of basic financial problems, to empirically show the positive relation between the tree distance and the distance of the corresponding optimal solutions, and between the tree distance and the optimal objective values. Moreover, we compute a lower bound for the Lipschitz constant that bounds the optimal value distance.

(2018). Multistage multivariate nested distance: An empirical analysis [journal article - articolo]. In KYBERNETIKA. Retrieved from http://hdl.handle.net/10446/133604

### Multistage multivariate nested distance: An empirical analysis

#### Abstract

Multistage stochastic optimization requires the definition and the generation of a discrete stochastic tree that represents the evolution of the uncertain parameters in time and space. The dimension of the tree is the result of a trade-off between the adaptability to the original probability distribution and the computational tractability. Moreover, the discrete approximation of a continuous random variable is not unique. The concept of the best discrete approximation has been widely explored and many enhancements to adjust and fix a stochastic tree in order to represent as well as possible the real distribution have been proposed. Yet, often, the same generation algorithm can produce multiple trees to represent the random variable. Therefore, the recent literature investigates the concept of distance between trees which are candidate to be adopted as stochastic framework for the multistage model optimization. The contribution of this paper is to compute the nested distance between a large set of multistage and multivariate trees and, for a sample of basic financial problems, to empirically show the positive relation between the tree distance and the distance of the corresponding optimal solutions, and between the tree distance and the optimal objective values. Moreover, we compute a lower bound for the Lipschitz constant that bounds the optimal value distance.
##### Scheda breve Scheda completa Scheda completa (DC)
articolo
Vitali, Sebastiano
(2018). Multistage multivariate nested distance: An empirical analysis [journal article - articolo]. In KYBERNETIKA. Retrieved from http://hdl.handle.net/10446/133604
File allegato/i alla scheda:
File
Multistage Multivariate Nested Distance an empirical analysis _ FINALE.pdf

Solo gestori di archivio

Versione: publisher's version - versione editoriale
Licenza: Licenza default Aisberg
Dimensione del file 3.21 MB