Approximation and Solution Schemes for Stochastic Dynamic Optimization Problems

Approximation and Solution Schemes for Stochastic Dynamic Optimization Problems

ParLisa A. Korf

Habituellement imprimé en 3-5 jours ouvrés
Optimization and control problems often need to be formulated in a way that takes the uncertainty of the future into account in order to accurately reflect a "good" decision that can stand up to a variety of possible future outcomes. One way of including uncertainty in such problems treats the uncertain parameters as a random vector with an underlying probability distribution. Doing this creates a stochastic programming model which is inherently infinite dimensional, or at best extremely large, in particular when many time stages are present. In order to solve such problems, a good approximation framework is needed that encompasses various approaches such as sampling and analytical methods for various problem classes. Complementing this should be a development of solution procedures that exploit a problem's structure, for example taking advantage of convexity and decomposability wherever possible. This dissertation addresses these key issues in four parts.

Détails

Date de publication
Jun 7, 2009
Langue
English
Catégorie
Ingénierie
Copyright
Tous droits réservés - Licence de copyright standard
Contributeurs
Par (auteur): Lisa A. Korf

Caractéristiques

Pages
117
Type de reliure
Livre à couverture souple Livre à couverture souple
Couleur de l’intérieur
Noir & Blanc
Dimensions
Lettre US (8,5 x 11 po / 216 x 279 mm)

Notes & Avis