Mathematics of Operations Research
HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS
 QUICK SEARCH:   [advanced]


     


MATHEMATICS OF OPERATIONS RESEARCH
Vol. 30, No. 3, August 2005, pp. 632-657
DOI: 10.1287/moor.1040.0137
This Article
Right arrow Full Text (PDF)
Right arrow References
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Download to citation manager
Right arrow reprints & permissions
Citing Articles
Right arrow Citing Articles via HighWire
Right arrow Citing Articles via Google Scholar
Google Scholar
Right arrow Articles by Popescu, I.
Right arrow Search for Related Content

A Semidefinite Programming Approach to Optimal-Moment Bounds for Convex Classes of Distributions

Ioana Popescu

Decision Sciences Area, INSEAD, Boulevard de Constance, Fontainebleau 77300, France
ioana.popescu{at}insead.edu, http://faculty.insead.edu/popescu/ioana

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 Chebyshev’s 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.

Key Words: moment problems; Chebyshev inequalities; probability bounds; convex optimization; inventory; semidefinite programming
History: Received: April 5, 2002; revision received: April 2, 2004;


This article has been cited by other articles:


Home page
Operations ResearchHome page
G. Perakis and G. Roels
Regret in the Newsvendor Model with Partial Information
Operations Research, January 1, 2008; 56(1): 188 - 203.
[Abstract] [PDF]


Home page
MSOMHome page
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
Copyright © 2005 by INFORMS.