Multi-stage stochastic optimization: the distance between stochastic scenario processes (Q2356157): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: reviewed by (P1447): Item:Q195460
RedirectionBot (talk | contribs)
Changed an Item
Property / reviewed by
 
Property / reviewed by: Antanas Žilinskas / rank
 
Normal rank

Revision as of 22:15, 10 February 2024

scientific article
Language Label Description Also known as
English
Multi-stage stochastic optimization: the distance between stochastic scenario processes
scientific article

    Statements

    Multi-stage stochastic optimization: the distance between stochastic scenario processes (English)
    0 references
    0 references
    29 July 2015
    0 references
    The stochastic programming problems with the stage-wise available information and information constraints are considered. A solution method proposed is based on the approximation techniques using nested distributions and their distances. The proposed type of distances between a stochastic scenario process and a tree, which includes infinite trees, and two stochastic processes given by their continuous distributions, facilitates the distribution quantization. The latter is applied to the development of approximation techniques for multi-stage stochastic programming problems. Two examples of application of the theoretical results are included: a multi-stage inventory control problem, and the catastrophic risk-management.
    0 references
    stochastic programming
    0 references
    approximation
    0 references
    nested distributions
    0 references

    Identifiers