Recent Results in Stochastic Programming: Proceedings, Oberwolfach, January 28 â " February 3, 1979: 179 (Lecture Notes in Economics and Mathematical Systems, 179)

Kall, P

ISBN 10: 354010013X / ISBN 13: 9783540100133

Published by Springer, 1980

About this Item

Clean copy, sound binding. Quick dispatch from UK seller.

Seller Inventory # mon0000125335

Bibliographic Details

• Title: Recent Results in Stochastic Programming: Proceedings, Oberwolfach, January 28 â " February 3, 1979: 179 (Lecture Notes in Economics and Mathematical Systems, 179)
• Publisher: Springer
• Publication Date: 1980
• Language: English
• ISBN 10: 354010013X
• ISBN 13: 9783540100133
• Binding: Paperback
• Condition: Good

About this title

Synopsis

This vo1ume contains most of the papers (two of the~ as extended abstracts) presented at a meeting on stochastic programming, held at Oberwolfach, January 28 - February 3, 1979. A1though the number of participants had to be small for technical rea­ sons, the area covered by the 1ectures during the meeting was rather broad. lt contains fundamental theoretical problems - e.g. continuity in parametric programming, optima1ity conditions and decision rules for stochastic programming problems and convexity statements also nee­ ded for chance constrained problems - as well as very important prac­ tical problems, as computational methods for various models and appli­ cations to water storage problems, dynamic inventory control, asphalt mixing, portfolio selection, and so on. Without any doubt there are still many theoretical and computational problems of this field unso1ved, and some of them can be discovered in this volume. On the other hand, the papers presented here also show, that during the last two decades knowledge - theoretical and computa­ tional - on stochastic programming, and practical experience with it, have been developped so far, that neglecting apriori the stochastic nature of parameters for almost every price - very often done in mo­ delling a practical decision situation as deterministic optimization problem - can no longer be justified.