Journal of Applied Probability · 1972 · 90 citations · 4 references
Natural SciencesComputer ScienceMathematicsOptimizationProbability TheoryStochastic ModelingConvex AnalysisConvex OptimizationNonlinear ProgrammingRandom VariablesStochastic OptimizationStochastic ProgrammingConvex FunctionsIndependent VariablesJensen's InequalityMultivariate DistributionsMultivariate Random VariablesRandom VectorUpper Bound ComputationUpper Bounds
Jensen gave a lower bound to Eρ ( T ), where ρ is a convex function of the random vector T. Madansky has obtained an upper bound via the theory of moment spaces of multivariate distributions. In particular, Madansky's upper bound is given explicitly when the components of T are independent random variables. For this case, lower and upper bounds are obtained in the paper, which uses additional information on T rather than its mean (mainly its expected absolute deviation about the mean) and hence gets closer to Eρ ( T ) . The importance of having improved bounds is illustrated through a nonlinear programming problem with stochastic objective function, known as the “wait and see” problem.
4
The Value of Information and Stochastic Programming
Mordecai Avriel, Adrian Williams · Operations Research · 1970 · 128 citations