Loading...
Please wait, while we are loading the content...
Similar Documents
Data-Driven Distributionally Robust Chance-Constrained Optimization With Wasserstein Metric
| Content Provider | Semantic Scholar |
|---|---|
| Author | Lejeune, M. A. |
| Copyright Year | 2018 |
| Abstract | We study distributionally robust chance-constrained programming (DRCCP) optimization problems with data-driven Wasserstein ambiguity sets. The proposed algorithmic and reformulation framework applies to distributionally robust optimization problems subjected to individual as well as joint chance constraints, with random right-hand side and technology vector, and under two types of uncertainties, called uncertain probabilities and continuum of realizations. For the uncertain probabilities case, we provide new mixed-integer linear programming reformulations for DRCCP problems and derive a set of precedence optimality cuts to strengthen the formulations. For the continuum of realizations case with random right-hand side, we propose an exact mixed-integer second-order cone programming (MISOCP) reformulation and a linear programming (LP) outer approximation. For the continuum of realizations case with random technology vector, we propose two MISOCP and LP outer approximations. We show that all proposed relaxations become exact reformulations when the decision variables are binary or bounded general integers. We evaluate the scalability and tightness of the proposed MISOCP and (MI)LP formulations on a distributionally robust chance-constrained knapsack problem. |
| File Format | PDF HTM / HTML |
| DOI | 10.2139/ssrn.3201356 |
| Alternate Webpage(s) | http://www.optimization-online.org/DB_FILE/2018/07/6697.pdf |
| Alternate Webpage(s) | https://doi.org/10.2139/ssrn.3201356 |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |
