Tight-and-Cheap Conic Relaxation for the Optimal Reactive Power Dispatch Problem
Tight-and-Cheap Conic Relaxation for the Optimal Reactive Power Dispatch Problem
复制标题
最优无功功率调度问题的紧且廉价的圆锥松弛
DOI：
--
复制
发表时间：
2018
影响因子：
6.6
通讯作者：
Sébastien Le Digabel
中科院分区：
文献类型：
--
作者：
Christian Bingane;M. Anjos;Sébastien Le Digabel
最优无功功率调度（ORPD）问题是交流最优潮流（ACOPF）问题，其中考虑用于调节无功功率的离散控制装置，例如分流元件和分接开关。 ORPD问题被建模为混合整数非线性优化问题，与高度非凸且通常难以求解的ACOPF问题相比，其复杂度有所增加。最近，ACOPF 问题的凸松弛引起了人们的极大兴趣，因为它们可以导致全局最优。我们提出了 ORPD 问题的紧密圆锥松弛，并表明与非凸连续松弛不同，应用这种松弛的舍入技术会产生具有非常小的保证最优性间隙的近全局最优解。我们报告了包含多达 3375 条总线的选定 MATPOWER 测试用例的计算结果。
The optimal reactive power dispatch (ORPD) problem is an alternating current optimal power flow (ACOPF) problem where discrete control devices for regulating the reactive power, such as shunt elements and tap changers, are considered. The ORPD problem is modeled as a mixed-integer nonlinear optimization problem and its complexity is increased compared to the ACOPF problem, which is highly nonconvex and generally hard to solve. Recently, convex relaxations of the ACOPF problem have attracted a significant interest since they can lead to global optimality. We propose a tight conic relaxation of the ORPD problem and show that a round-off technique applied with this relaxation leads to near-global optimal solutions with very small guaranteed optimality gaps, unlike with the nonconvex continuous relaxation. We report computational results on selected MATPOWER test cases with up to 3375 buses.