Computationally Tractable Counterparts of Distributionally Robust Constraints on Risk Measures
نویسندگان
چکیده
In optimization problems appearing in fields such as economics, finance, or engineering, it is often important that a risk measure of a decision-dependent random variable stays below a prescribed level. At the same time, the underlying probability distribution determining the risk measure’s value is typically known only up to a certain degree and the constraint should hold for a reasonably wide class of probability distributions. In addition to that, the constraint should be computationally tractable. In this paper we review and generalize results on the derivation of tractable counterparts of such constraints for discrete probability distributions. Using established techniques in robust optimization, we show that the derivation of a tractable robust counterpart can be split into two parts: one corresponding to the risk measure and the other to the uncertainty set. This holds for a wide range of risk measures and uncertainty sets for probability distributions defined using statistical goodness-of-fit tests or probability metrics. In this way, we provide a unified framework of reformulating this class of constraints, extending the number of solvable risk measure-uncertainty set combinations considerably, including also risk measures that are nonlinear in the probabilities. To provide a clear overview for the user, we give the computational tractability status for each of the uncertainty set-risk measure pairs of which some have been solved in the literature. Examples, including portfolio optimization and antenna array design, illustrate the proposed approach in a theoretical and numerical setting.
منابع مشابه
Distributionally Robust Optimization with Infinitely Constrained Ambiguity Sets
We consider a distributionally robust optimization problem where the ambiguity set of probability distributions is characterized by a tractable conic representable support set and expectation constraints. Specifically, we propose and motivate a new class of infinitely constrained ambiguity sets in which the number of expectation constraints could potentially be infinite. We show how the infinit...
متن کاملTractable Distributionally Robust Optimization with Data
We present a unified and tractable framework for distributionally robust optimization that could encompass a variety of statistical information including, among others things, constraints on expectation, conditional expectation, and disjoint confidence sets with uncertain probabilities defined by φ-divergence. In particular, we also show that the Wasserstein-based ambiguity set has an equivalen...
متن کاملData-driven Distributionally Robust Optimization Using the Wasserstein Metric: Performance Guarantees and Tractable Reformulations
We consider stochastic programs where the distribution of the uncertain parameters is only observable through a finite training dataset. Using the Wasserstein metric, we construct a ball in the space of (multivariate and non-discrete) probability distributions centered at the uniform distribution on the training samples, and we seek decisions that perform best in view of the worst-case distribu...
متن کاملDistributionally robust chance constraints for non-linear uncertainties
This paper investigates the computational aspects of distributionally robust chance constrained optimization problems. In contrast to previous research that mainly focused on the linear case (with a few exceptions discussed in detail below), we consider the case where the constraints can be non-linear to the decision variable, and in particular to the uncertain parameters. This formulation is o...
متن کاملDistributionally Robust Convex Optimization
Distributionally robust optimization is a paradigm for decision-making under uncertaintywhere the uncertain problem data is governed by a probability distribution that is itself subjectto uncertainty. The distribution is then assumed to belong to an ambiguity set comprising alldistributions that are compatible with the decision maker’s prior information. In this paper,we propose...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- SIAM Review
دوره 58 شماره
صفحات -
تاریخ انتشار 2016