| Generalized Bounds for Convex Multistage Stochastic Programs 2005 Edition Contributor(s): Kuhn, Daniel (Author) |
|
 |
ISBN: 3540225404 ISBN-13: 9783540225409 Publisher: Springer OUR PRICE: $52.24 Product Type: Paperback - Other Formats Published: October 2004 |
| Additional Information |
| BISAC Categories: - Computers | Computer Science - Mathematics | Linear & Nonlinear Programming - Business & Economics | Operations Research |
| Dewey: 519.2 |
| LCCN: 2004109705 |
| Series: Lecture Notes |
| Physical Information: 0.45" H x 6.14" W x 9.21" (0.67 lbs) 190 pages |
| Descriptions, Reviews, Etc. |
| Publisher Description: This work was completed during my tenure as a scientific assistant and d- toral student at the Institute for Operations Research at the University of St. Gallen. During that time, I was involved in several industry projects in the field of power management, on the occasion of which I was repeatedly c- fronted with complex decision problems under uncertainty. Although usually hard to solve, I quickly learned to appreciate the benefit of stochastic progr- ming models and developed a strong interest in their theoretical properties. Motivated both by practical questions and theoretical concerns, I became p- ticularly interested in the art of finding tight bounds on the optimal value of a given model. The present work attempts to make a contribution to this important branch of stochastic optimization theory. In particular, it aims at extending some classical bounding methods to broader problem classes of practical relevance. This book was accepted as a doctoral thesis by the University of St. Gallen in June 2004.1 am particularly indebted to Prof. Dr. Karl Frauendorfer for - pervising my work. I am grateful for his kind support in many respects and the generous freedom I received to pursue my own ideas in research. My gratitude also goes to Prof. Dr. Georg Pflug, who agreed to co-chair the dissertation committee. With pleasure I express my appreciation for his encouragement and continuing interest in my work. |