Geodesic
Multistage multivariate nested distance: An empirical analysis
Kybernetika, Tome 54 (2018) no. 6, pp. 1184-1200
Cet article a éte moissonné depuis la source Czech Digital Mathematics Library

Voir la notice de l'article

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.
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.
DOI : 10.14736/kyb-2018-6-1184
Classification : 60B05, 62P05, 90C15
Keywords: multistage stochastic optimization; nested distance; portfolio models 
@article{10_14736_kyb_2018_6_1184,
     author = {Vitali, Sebastiano},
     title = {Multistage multivariate nested distance: {An} empirical analysis},
     journal = {Kybernetika},
     pages = {1184--1200},
     year = {2018},
     volume = {54},
     number = {6},
     doi = {10.14736/kyb-2018-6-1184},
     mrnumber = {3902628},
     zbl = {07031768},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.14736/kyb-2018-6-1184/}
}
TY  - JOUR
AU  - Vitali, Sebastiano
TI  - Multistage multivariate nested distance: An empirical analysis
JO  - Kybernetika
PY  - 2018
SP  - 1184
EP  - 1200
VL  - 54
IS  - 6
UR  - http://geodesic.mathdoc.fr/articles/10.14736/kyb-2018-6-1184/
DO  - 10.14736/kyb-2018-6-1184
LA  - en
ID  - 10_14736_kyb_2018_6_1184
ER  - 
%0 Journal Article
%A Vitali, Sebastiano
%T Multistage multivariate nested distance: An empirical analysis
%J Kybernetika
%D 2018
%P 1184-1200
%V 54
%N 6
%U http://geodesic.mathdoc.fr/articles/10.14736/kyb-2018-6-1184/
%R 10.14736/kyb-2018-6-1184
%G en
%F 10_14736_kyb_2018_6_1184
Vitali, Sebastiano. Multistage multivariate nested distance: An empirical analysis. Kybernetika, Tome 54 (2018) no. 6, pp. 1184-1200. doi: 10.14736/kyb-2018-6-1184

[1] Birge, J. R., Louveaux, F.: Introduction to Stochastic Programming. Springer Science and Business Media, 2011. | MR

[2] Consigli, G., Moriggia, V., Benincasa, E., Landoni, G., Petronio, F., Vitali, S., Tria, M. di, Skoric, M., Uristani, A.: Optimal multistage defined-benefit pension fund management. In: Recent Advances in Commmodity and Financial Modeling: Quantitative methods in Banking, Finance, Insurance, Energy and Commodity markets (G. Consigli, S. Stefani, and G. Zambruno eds.), Springer's International Series in Operations Research and Management Science, 2017. | DOI | MR

[3] Dupačová, J., Hurt, J., Štěpán, J.: Stochastic Modeling in Economics and Finance. Applied Optimization, Springer, 2002. | DOI | MR

[4] Kilianová, S., Pflug, G. C.: Optimal pension fund management under multi-period risk minimization. Ann. Oper. Res. 166 (2009), 1, 261-270. | DOI | MR

[5] Kopa, M., Petrová, B.: Multistage risk premiums in portfolio optimization. Kybernetika 53 (2017), 6, 992-1011. | DOI | MR

[6] Kopa, M., Moriggia, V., Vitali, S.: Individual optimal pension allocation under stochastic dominance constraints. Ann. Oper. Res. 260 (2018), 1,2, 255-291. | DOI | MR

[7] Kovacevic, R. M., Pichler, A.: Tree approximation for discrete time stochastic processes: a process distance approach. Ann. Oper. Res. 235 (2015), 1, 395-421. | DOI | MR

[8] Maggioni, F., Pflug, G. C.: Bounds and approximations for multistage stochastic programs. SIAM J. Optim. 26 (2016), 1, 831-855. | DOI | MR

[9] Maggioni, F., Allevi, E., Bertocchi, M.: Bounds in multistage linear stochastic programming. J. Optim. Theory Appl. 163 (2014), 1, 200-229. | DOI | MR

[10] Maggioni, F., Allevi, E., Bertocchi, M.: Monotonic bounds in multistage mixed-integer liner stochastic programming. Comput. Management Sci. 13 (2016), 3, 423-457. | DOI | MR

[11] Pflug, G. C., Pichler, A.: A distance for multistage stochastic optimization models. SIAM J. Optim. 22 (2012), 1, 1-23. | DOI

[12] Pflug, G. C., Pichler, A.: Multistage Stochastic Optimization. Springer, 2014. | DOI

[13] Pflug, G. C., Pichler, A.: Convergence of the smoothed empirical process in nested distance. Humboldt-Universität zu Berlin, Mathematisch-Naturwissenschaftliche Fakultät II, Institut fűr Mathematik (J. L. Higle, W. Römisch, and S. Surrajeet, eds.), 2015.

[14] Pflug, G. C., Pichler, A.: From empirical observations to tree models for stochastic optimization: Convergence properties. SIAM J. Optim. 26 (2016), 3, 1715-1740. | DOI | MR

[15] Powell, W. B.: Clearing the jungle of stochastic optimization. Informs TutORials, 2014. | DOI

[16] Rockafellar, T. R., Uryasev, S.: Optimization of conditional value-at-risk. J. Risk 2 (2000), 21-42. | DOI

[17] Shapiro, A., Dentcheva, D., Ruszczyński, A.: Lectures on stochastic programing. Modeling and Theory. SIAM Math. Programm. Soc. 2009. | MR

[18] Timonina, A. V.: Multi-stage stochastic optimization: the distance between stochastic scenario processes. Computat. Management Sci. 12 (2015), 1, 171-195. | DOI | MR

[19] Vitali, S., Moriggia, V., Kopa, M.: Optimal pension fund composition for an Italian private pension plan sponsor. Comput. Management Sci. 14 (2017), 1, 135-160. | DOI | MR

Cité par Sources :