Multistage Stochastic Programs via Stochastic Parametric Optimization
Vlasta Kaňková
Abstract
Vlasta Kaňková
Abstract
Abstract Multistage stochastic programming problems can be defined as a finite system of (mostly parametric) one-stage stochastic programming problems with an inner type of dependence (for details see e.g. [1], [2], [6]). Employing this approach we can introduce the multistage (M+1-stage, M ≥ 1) stochastic programming problem as the problem.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Abstract Multistage stochastic programming problems can be defined as a finite system of (mostly parametric) one-stage stochastic programming problems with an inner type of dependence (for details see e.g. [1], [2], [6]). Employing this approach we can introduce the multistage (M+1-stage, M ≥ 1) stochastic programming problem as the problem.
Key concepts: Stochastic programming, Stochastic optimization, Mathematical optimization, Parametric statistics, Computer science, Parametric programming, Dynamic programming, Stochastic modelling