Distributionally Robust Convex Optimization

Distributionally robust optimization is a paradigm for decision-making under uncertainty where the uncertain problem data is governed by a probability distribution that is itself subject to uncertainty. The distribution is then assumed to belong to an ambiguity set comprising all distributions that are compatible with the decision maker's prior information. In this paper, we propose a unifying framework for modeling and solving distributionally robust optimization problems. We introduce standardized ambiguity sets that contain all distributions with prescribed conic representable confidence sets and with mean values residing on an affine manifold. These ambiguity sets are highly expressive and encompass many ambiguity sets from the recent literature as special cases. They also allow us to characterize distributional families in terms of several classical and/or robust statistical indicators that have not yet been studied in the context of robust optimization. We determine sharp conditions under which distributionally robust optimization problems based on our standardized ambiguity sets are computationally tractable. We also provide tractable conservative approximations for problems that violate these conditions.


Publié dans:
Operations Research, 62, 6, 1358-1376
Année
2014
Mots-clefs:
Note:
Available from Optimization Online
Laboratoires:




 Notice créée le 2014-01-22, modifiée le 2019-12-05

Lien externe:
Télécharger le document
URL
Évaluer ce document:

Rate this document:
1
2
3
 
(Pas encore évalué)