AC-Feasibility on Tree Networks is NP-Hard
AC-Feasibility on Tree Networks is NP-Hard
复制标题
树形网络上的 AC 可行性是 NP 难的
DOI：
--
复制
发表时间：
2014
影响因子：
6.6
通讯作者：
Pascal Van Hentenryck
中科院分区：
文献类型：
--
作者：
Karsten Lehmann;Alban Grastien;Pascal Van Hentenryck
近年来，人们对潮流的凸松弛产生了极大的兴趣，有几篇论文表明，在各种负载或电压条件下，树网络的二阶锥松弛是紧的。本文表明，交流的可行性，即，对于树型网络，寻找某个发电机的调度是否满足给定的需求是NP难的。
Recent years have witnessed significant interest in convex relaxations of the power flows, with several papers showing that the second-order cone relaxation is tight for tree networks under various conditions on loads or voltages. This paper shows that ac-feasibility, i.e., to find whether some generator dispatch can satisfy a given demand, is NP-hard for tree networks.