Abstract
When formulating a stochastic programming problem, we usually start from a deterministic problem that we call underlying deterministic problem. Then, observing that some of the parameters are random, we formulate another problem, the stochastic programming problem, by taking into account the probability distribution of the random elements in the underlying problem. When decision can or has to be made in the presence of randomness, at one single step, i.e., we do not wait for the occurrence of any event or realization of some random variable(s), then we say that the stochastic programming model is static. The two words: model and problem are used as synonyms. In the strict sense, the model specifies the assumptions made concerning the system in mathematical terms and identifies system parameters with mathematical objects. Having these, we formulate a problem to be solved and use the obtained result for descriptive or operative purposes.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1995 András Prékopa
About this chapter
Cite this chapter
Prékopa, A. (1995). Static Stochastic Programming Models. In: Stochastic Programming. Mathematics and Its Applications, vol 324. Springer, Dordrecht. https://doi.org/10.1007/978-94-017-3087-7_8
Download citation
DOI: https://doi.org/10.1007/978-94-017-3087-7_8
Publisher Name: Springer, Dordrecht
Print ISBN: 978-90-481-4552-2
Online ISBN: 978-94-017-3087-7
eBook Packages: Springer Book Archive