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 order cone (SOC) constraints, and hence the probability constrained linear program can be solved exactly with great efficiency. We next analyze the situation when the probability distribution of the data in not completely specified, but it is only known to belong to a given class of distributions. In this case, we provide explicit convex conditions that guarantee the satisfaction of the probability constraints, for any possible distribution belonging to the given class. Application examples to portfolio optimization and model predictive control are used to illustrate the results.
منابع مشابه
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...
متن کاملOn distributionally robust joint chance-constrained problems
Introduction: A chance constrained optimization problem involves constraints with stochastic data that are required to be satisfied with a pre-specified probability. When the underlying distribution of the stochastic data is not known precisely, an often used model is to require the chance constraints to hold for all distributions in a given family. Such a problem is known as a distributionally...
متن کاملExistence of Nash equilibrium for distributionally robust chance-constrained games
We consider an n-player finite strategic game. The payoff vector of each player is a random vector whose distribution is not completely known. We assume that the distribution of the random payoff vector of each player belongs to a distributional uncertainty set. Using distributionally robust approach, we define a chance-constrained game with respect to the worst-case chanceconstraint. We call s...
متن کاملKullback-Leibler Divergence Constrained Distributionally Robust Optimization
In this paper we study distributionally robust optimization (DRO) problems where the ambiguity set of the probability distribution is defined by the Kullback-Leibler (KL) divergence. We consider DRO problems where the ambiguity is in the objective function, which takes a form of an expectation, and show that the resulted minimax DRO problems can be formulated as a one-layer convex minimization ...
متن کاملOn Distributionally Robust Chance-Constrained Linear Programs1
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 (namely, radial distributions) on the data, the probability constraints can be converted explicitly into convex se...
متن کاملDistributionally Robust Chance-Constrained Bin Packing
Chance-constrained bin packing problem allocates a set of items into bins and, for each bin, bounds the probability that the total weight of packed items exceeds the bin’s capacity. Different from the stochastic programming approaches relying on full distributional information of the random item weights, we assume that only the information of the mean and covariance matrix is available. Accordi...
متن کامل