arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2205.03370math.OC
收藏

联合机会约束问题的紧致样本平均近似及其在最优潮流中的应用

Tight and Compact Sample Average Approximation for Joint Chance-constrained Problems with Applications to Optimal Power Flow

Álvaro Porras, Concepción Domínguez, Juan M. Morales, Salvador Pineda

AI总结:

本文针对样本平均近似重构的机会约束问题,提出结合有效不等式、系数强化与约束筛选的精确求解方法,有效改善 Big-Ms 并缩减问题规模,在 DC Optimal Power Flow 中验证了其高效性。

摘要:

本文解决通过样本平均近似重新表述的机会约束问题。所得的数据驱动确定性重构形式为受 Big-Ms 困扰的大规模混合整数规划(MIP)。我们引入一种求解 MIP 的精确方法,结合添加一组有效不等式以收紧线性松弛边界,并采用系数强化和约束筛选算法来改善 Big-Ms,显著减小问题规模。所提有效不等式基于 k-envelopes 概念,可使用多项式时间算法离线计算,并一次性加入 MIP 程序。此外,它们同样有助于提升 Big-Ms 的强化效果和多余约束的筛选率。我们将上述方法应用于含不确定需求的 DC Optimal Power Flow 问题的概率约束版本。该机会约束要求违反电力系统任一约束的概率低于某参数 $ε> 0$。在涉及五个不同规模电力系统的数值实验中,我们展示了所提方法的效率,并与文献中现有表现最佳的凸内近似方法进行了比较。

英文摘要:

In this paper, we tackle the resolution of chance-constrained problems reformulated via Sample Average Approximation. The resulting data-driven deterministic reformulation takes the form of a large-scale mixed-integer program cursed with Big-Ms. We introduce an exact resolution method for the MIP that combines the addition of a set of valid inequalities to tighten the linear relaxation bound with coefficient strengthening and constraint screening algorithms to improve its Big-Ms and considerably reduce its size. The proposed valid inequalities are based on the notion of k-envelopes, can be computed offline using polynomial-time algorithms, and added to the MIP program all at once. Furthermore, they are equally useful to boost the strengthening of the Big-Ms and the screening rate of superfluous constraints. We apply our procedures to a probabilistically-constrained version of the DC Optimal Power Flow problem with uncertain demand. The chance constraint requires that the probability of violating any of the power system's constraints be lower than some parameter $ε> 0$. In a series of numerical experiments which involve five power systems of different size, we show the efficiency of the proposed methodology and compare it with some of the best-performing convex inner approximations currently available in the literature.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑