Barycentric Scenario Trees in Convex Multistage Stochastic Programming

Auteur(s)

Karl Frauendorfer

Accéder

Description

This work deals with the approximation of convex stochastic multistage programs allowing prices and demand to be stochastic with compact support. Based on earlier results, sequences of barycentric scenario trees with associated probability trees are derived for minorizing and majorizing the given problem. Error bounds for the optimal policies of the approximate problem and duality analysis with respect to the stochastic data determine the scenarios which improve the approximation. Convergence of the approximate solutions is proven under the stated assumptions. Preliminary computational results are outlined.

Langue

English

Date

1996

Le portail de l'information économique suisse

© 2016 Infonet Economy