.png){kind=icon}
返回
Exploiting structure of chance constrained programs via submodularity
.png){kind=icon}
OA
AI
DOI：10.1016/j.automatica.2019.03.027.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We introduce a novel approach to reduce the computational effort of solving convex chance constrained programs through the scenario approach. Instead of reducing the number of required scenarios, we directly minimize the computational cost of the scenario program. We exploit the problem structure by efficiently partitioning the constraint function and considering a multiple chance constrained program that gives the same probabilistic guarantees as the original single chance constrained problem. We formulate the problem of finding the optimal partition, a partition achieving the lowest computational cost, as an optimization problem with nonlinear objective and combinatorial constraints. By using submodularity of the support rank of a set of constraints, we propose a polynomial-time algorithm to find suboptimal solutions to this partitioning problem and we give approximation guarantees for special classes of cost metrics. We illustrate that the resulting computational cost savings can be arbitrarily large and demonstrate our approach on a case study from production planning. (C) 2019 Elsevier Ltd. All rights reserved.
Keyword:
Chance constrained optimization
Randomized methods
Submodular minimization
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
5.9
论文数:
1.2W
被引数:
5.2W
机构
引用论文
Randomized methods for design of uncertain systems: Sample complexity and sequential algorithms.png)
AUTOMATICAOAAI
AUTOMATICAIF5.9
OAAI分享收藏
查看更多内容