Journal
JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS
Volume 130, Issue 1, Pages 1-22Publisher
SPRINGER/PLENUM PUBLISHERS
DOI: 10.1007/s10957-006-9084-x
Keywords
chance-constrained optimization; probability-constrained optimization; uncertain linear programs; robustness; convex second-order cone constraints
Ask authors/readers for more resources
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 second-order cone constraints; hence, the probability-constrained linear program can be solved exactly with great efficiency. Next, we analyze the situation where the probability distribution of the data is not completely specified, but 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.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available