Bounds on the Expectation of a Convex Function of a Random Variable: With Applications to Stochastic Programming

C. C. Huang, W. T. Ziemba and A. Ben-Tal
Additional contact information
C. C. Huang: University of British Columbia, Vancouver, British Columbia
W. T. Ziemba: Memorial University of Newfoundland, St. Johns, Newfoundland
A. Ben-Tal: Technion, Haifa, Israel

Operations Research, 1977, vol. 25, issue 2, 315-325

Abstract: This paper is concerned with the determination of tight lower and upper bounds on the expectation of a convex function of a random variable. The classic bounds are those of Jensen and Edmundson-Madansky and were recently generalized by Ben-Tal and Hochman. This paper indicates how still sharper bounds may be generated based on the simple idea of sequentially applying the classic bounds to smaller and smaller subintervals of the range of the random variable. The bounds are applicable in the multivariate case if the random variables are independent. In the dependent case bounds based on the Edmundson-Madansky inequality are not available; however, bounds may be developed using the conditional form of Jensen's inequality. We give some examples to illustrate the geometrical interpretation and the calculations involved in the numerical determination of the new bounds. Special attention is given to the problem of maximizing a nonlinear program that has a stochastic objective function.

Date: 1977
References: Add references at CitEc
Citations: View citations in EconPapers (11)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.25.2.315 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:25:y:1977:i:2:p:315-325

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().