On Distributionally Robust Chance-Constrained Linear Programs |
| |
Authors: | G C Calafiore L El Ghaoui |
| |
Institution: | (1) Dipartimento di Automatica e Informatica, Politecnico di Torino, Torino, Italy;(2) Department of Electrical Engineering and Computer Science, University of California at Berkeley, Berkeley, California |
| |
Abstract: | 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.Communicated by B. T. PolyakThis work was supported by FIRB funds from the Italian Ministry of University and Research. |
| |
Keywords: | Chance-constrained optimization probability-constrained optimization uncertain linear programs robustness convex second-order cone constraints |
本文献已被 SpringerLink 等数据库收录! |
|