arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1410.8253cs.CCmath.OC
收藏

树型网络上的AC可行性是NP难的

AC-Feasibility on Tree Networks is NP-Hard

Karsten Lehmann, Alban Grastien, Pascal Van Hentenryck

摘要:

近年来,人们对潮流的凸松弛问题产生了极大的兴趣,一些论文表明,在各种负载或电压条件下,树形网络的二阶锥松弛是紧的。本文表明,AC可行性,即,对于树型网络,求某个发电机的调度是否满足给定的需求是NP-Hard问题。

英文摘要:

Recent years have witnessed significant interest in convex relaxations of the power flows, 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.

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

↑