Abstract
Consider the following stochastic programming problem:
In (3.6.1), x is a decision vector to be selected from a closed, bounded subset D 0 of the n-dimensional real Euclidean space ℝ n; y is a q-dimensional vector valued random variable; f i , i = 0, 1,...,I, are respectively defined measurable functions; E is the symbol of mathematical expectation (the expected values are supposed to exist). Note that (3.6.1) is a fairly general stochastic programming model form; it encompasses—under suitable transformations—the ‘model block’ and types discussed in the previous chapter.
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
© 1996 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Pintér, J.D. (1996). Adaptive Stochastic Optimization Procedures. In: Global Optimization in Action. Nonconvex Optimization and Its Applications, vol 6. Springer, Boston, MA. https://doi.org/10.1007/978-1-4757-2502-5_15
Download citation
DOI: https://doi.org/10.1007/978-1-4757-2502-5_15
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4419-4751-2
Online ISBN: 978-1-4757-2502-5
eBook Packages: Springer Book Archive