Multi-stage stochastic optimization: The distance between stochastic scenario processes

Timonina, A.V. (2015). Multi-stage stochastic optimization: The distance between stochastic scenario processes. Computational Management Science 12 (1) 171-195. 10.1007/s10287-013-0185-3.

Full text not available from this repository.

Abstract

Approximation techniques are challenging, important and very often irreplaceable solution methods for multi-stage stochastic optimization programs. Applications for scenario process approximation include financial and investment planning, inventory control, energy production and trading, electricity generation planning, pension fund management, supply chain management and similar fields. In multi-stage stochastic optimization problems the amount of stage-wise available information is crucial. While some authors deal with filtration distances, in this paper we consider the concepts of nested distributions and their distances which allows to keep the setup purely distributional but at the same time to introduce information and information constraints. Also we introduce the distance between stochastic process and a tree and we generalize the concept of nested distance for the case of infinite trees, i.e. for the case of two stochastic processes given by their continuous distributions. We are making a step towards to a new method for distribution quantization that is the most suitable for multi-stage stochastic optimization programs as it takes into account both the stochastic process and the stage-wise information.

Item Type:	Article
Research Programs:	Risk, Policy and Vulnerability (RPV) Risk & Resilience (RISK)
Bibliographic Reference:	Computational Management Science; 12(1):171-195 (January 2015) (Published online 24 August 2013)
Depositing User:	IIASA Import
Date Deposited:	15 Jan 2016 08:53
Last Modified:	27 Aug 2021 17:39
URI:	https://pure.iiasa.ac.at/11528

Actions (login required)

View Item