Conic Programming Reformulations of Two-Stage Distributionally Robust Linear Programs over Wasserstein Balls
نویسندگان
چکیده
منابع مشابه
Conic Programming Reformulations of Two-Stage Distributionally Robust Linear Programs over Wasserstein Balls
Adaptive robust optimization problems are usually solved approximately by restricting the adaptive decisions to simple parametric decision rules. However, the corresponding approximation error can be substantial. In this paper we show that two-stage robust and distributionally robust linear programs can often be reformulated exactly as conic programs that scale polynomially with the problem dim...
متن کاملDecomposition Algorithms for Two-Stage Distributionally Robust Mixed Binary Programs
In this paper, we introduce and study a two-stage distributionally robust mixed binary problem (TSDR-MBP) where the random parameters follow the worst-case distribution belonging to an uncertainty set of probability distributions. We present a decomposition algorithm, which utilizes distribution separation procedure and parametric cuts within Benders’ algorithm or Lshaped method, to solve TSDR-...
متن کاملDistributionally Robust Reward-risk Ratio Programming with Wasserstein Metric
Reward-risk ratio (RR) is a very important stock market definition. In order to capture the situation that the investor does not have complete information on the distribution of the underlying uncertainty, people extend RR model to distributionally robust reward-risk ratio (DRR) model. In this paper, we study the DRR problem where the ambiguity on the distributions is defined through Wassertein...
متن کاملK-adaptability in two-stage distributionally robust binary programming
We propose to approximate two-stage distributionally robust programs with binary recourse decisions by their associated K-adaptability problems, which pre-select K candidate secondstage policies here-and-now and implement the best of these policies once the uncertain parameters have been observed. We analyze the approximation quality and the computational complexity of the K-adaptability proble...
متن کاملDistributionally robust chance-constrained linear programs
In this paper, we discuss linear programs in which the data that specify the constraints are subject to random uncertainty. A usual approach in this setting is to enforce the constraints up to a given level of probability. We show that for a wide class of probability distributions (i.e. radial distributions) on the data, the probability constraints can be explicitly converted into convex second...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Operations Research
سال: 2018
ISSN: 0030-364X,1526-5463
DOI: 10.1287/opre.2017.1698