|
|
||||||||
Decision Sciences Area, INSEAD, Boulevard de Constance, Fontainebleau 77300, France
We provide an optimization framework for computing optimal upper and lower bounds on functional expectations of distributions with special properties, given moment constraints. Bertsimas and Popescu (Optimal inequalities in probability theory: a convex optimization approach. SIAM J. Optim. 2004. Forthcoming) have already shown how to obtain optimal moment inequalities for arbitrary distributions via semidefinite programming. These bounds are not sharp if the underlying distributions possess additional structural properties, including symmetry, unimodality, convexity, or smoothness. For convex distribution classes that are in some sense generated by an appropriate parametric family, we use conic duality to show how optimal moment bounds can be efficiently computed as semidefinite programs. In particular, we obtain generalizations of Chebyshevs inequality for symmetric and unimodal distributions and provide numerical calculations to compare these bounds, given higher-order moments. We also extend these results for multivariate distributions.
ioana.popescu{at}insead.edu, http://faculty.insead.edu/popescu/ioana
History: Received: April 5, 2002;
revision received: April 2, 2004;
This article has been cited by other articles:
![]() |
G. Perakis and G. Roels Regret in the Newsvendor Model with Partial Information Operations Research, January 1, 2008; 56(1): 188 - 203. [Abstract] [PDF] |
||||
![]() |
The MSOM Society Student Paper Competition: Extended Abstracts of 2005 Winners MSOM, January 1, 2006; 8(1): 98 - 117. [Abstract] [PDF] |
||||
| HOME | HELP | FEEDBACK | SUBSCRIPTIONS | ARCHIVE | SEARCH | TABLE OF CONTENTS |