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


     


OPERATIONS RESEARCH
Vol. 51, No. 4, July-August 2003, pp. 543-556
DOI: 10.1287/opre.51.4.543.16101
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 Ghaoui, L. E.
Right arrow Articles by Oustry, F.
Right arrow Search for Related Content

Worst-Case Value-At-Risk and Robust Portfolio Optimization: A Conic Programming Approach

Laurent El Ghaoui, Maksim Oks, Francois Oustry

Department of Electrical Engineering and Computer Sciences, University of California, Berkeley, California 94720
Department of Industrial Engineering and Operations Research, University of California, Berkeley, California 94720
INRIA Rhone-Alpes ZIRST, 655 avenue de l'Europe 38330 Montbonnot Saint-Martin, France

elghaoui{at}eecs.berkeley.edu
max{at}ieor.berkeley.edu
francois.oustry{at}inria.fr

Classical formulations of the portfolio optimization problem, such as mean-variance or Value-at-Risk (VaR) approaches, can result in a portfolio extremely sensitive to errors in the data, such as mean and covariance matrix of the returns. In this paper we propose a way to alleviate this problem in a tractable manner. We assume that the distribution of returns is partially known, in the sense that only bounds on the mean and covariance matrix are available. We define the worst-case Value-at-Risk as the largest VaR attainable, given the partial information on the returns' distribution. We consider the problem of computing and optimizing the worst-case VaR, and we show that these problems can be cast as semidefinite programs. We extend our approach to various other partial information on the distribution, including uncertainty in factor models, support constraints, and relative entropy information.

Subject classifications: Finance, portfolio: Value-at-Risk, portfolio optimization; Programming, nonlinear: semidefinite programming, dualing, robust optimization.
History: Received September 2001; revision received July 2002; accepted July 2002.




This article has been cited by other articles:


Home page
Operations ResearchHome page
P. Bonami and M. A. Lejeune
An Exact Solution Approach for Portfolio Optimization Problems Under Stochastic and Integer Constraints
Operations Research, May 1, 2009; 57(3): 650 - 670.
[Abstract] [PDF]


Home page
Management ScienceHome page
K. Natarajan, D. Pachamanova, and M. Sim
Incorporating Asymmetric Distributional Information in Robust Value-at-Risk Optimization
Management Science, March 1, 2008; 54(3): 573 - 585.
[Abstract] [PDF]


Home page
Operations ResearchHome page
A. E. B. Lim and J. G. Shanthikumar
Relative Entropy, Exponential Utility, and Robust Dynamic Pricing
Operations Research, March 1, 2007; 55(2): 198 - 214.
[Abstract] [PDF]


Home page
Operations ResearchHome page
I. Popescu
Robust Mean-Covariance Solutions for Stochastic Optimization
Operations Research, January 1, 2007; 55(1): 98 - 112.
[Abstract] [PDF]


Home page
Mathematics of Operations ResearchHome page
I. Popescu
A Semidefinite Programming Approach to Optimal-Moment Bounds for Convex Classes of Distributions
Mathematics of Operations Research, August 1, 2005; 30(3): 632 - 657.
[Abstract] [PDF]




HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS
Copyright © 2003 by INFORMS.