Distributionally Robust Optimization Under Moment Uncertainty with Application to Data-Driven Problems
HEC Montréal · Stanford University
Abstract
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…
Citation impact
- FWCI
- 36.93
- Percentile
- 100%
- References
- 60
Authors
2Topics & keywords
- Mathematical optimization
- Computer science
- Probabilistic logic
- Ambiguity
- Portfolio optimization
- Stochastic programming
- Portfolio
- Robust optimization
- Peace, Justice and strong institutions