Bounds in multistage linear stochastic programming (Q467481)

From MaRDI portal
Revision as of 23:32, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
scientific article
Language Label Description Also known as
English
Bounds in multistage linear stochastic programming
scientific article

    Statements

    Bounds in multistage linear stochastic programming (English)
    0 references
    0 references
    0 references
    0 references
    3 November 2014
    0 references
    The authors aim at generalizations of bounds developed for two-stage stochastic linear programming to scenario-based multistage stochastic linear programs. The starting points are the well-known convexity based Jensen and Edmundson-Madansky bounds and the value of stochastic solutions and their extensions, followed by heuristic bounds based on deterministic skeleton solutions, and several rolling horizon variants. Chains of inequalities among the proposed lower and upper bounds for the optimal value are provided and illustrated for a multistage single-sink transportation problem.
    0 references
    multistage stochastic programming
    0 references
    expected value problem
    0 references
    value of stochastic solution
    0 references
    skeleton solution
    0 references

    Identifiers