Distributionally Robust Optimization Under Moment Uncertainty with Application to Data-Driven Problems

被引:1245
作者
Delage, Erick [1 ]
Ye, Yinyu [2 ]
机构
[1] HEC Montreal, Dept Management Sci, Montreal, PQ H3T 2A7, Canada
[2] Stanford Univ, Dept Management Sci & Engn, Stanford, CA 94305 USA
关键词
CONVEX-PROGRAMS; SAMPLE ROOTS;
D O I
10.1287/opre.1090.0741
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
Stochastic programming can effectively describe many decision-making problems in uncertain environments. Unfortunately, such programs are often computationally demanding to solve. In addition, their solution can be misleading when there is ambiguity in the choice of a distribution for the random parameters. In this paper, we propose a model that describes uncertainty in both the distribution form (discrete, Gaussian, exponential, etc.) and moments (mean and covariance matrix). We demonstrate that for a wide range of cost functions the associated distributionally robust (or min-max) stochastic program can be solved efficiently. Furthermore, by deriving a new confidence region for the mean and the covariance matrix of a random vector, we provide probabilistic arguments for using our model in problems that rely heavily on historical data. These arguments are confirmed in a practical example of portfolio selection, where our framework leads to better-performing policies on the "true" distribution underlying the daily returns of financial assets.
引用
收藏
页码:595 / 612
页数:18
相关论文
共 47 条