AC-Feasibility on Tree Networks is NP-Hard

Select |




Print


Lehmann, Karsten; Grastien, Alban; Van Hentenryck, Pascal


2015-03-18


Journal Article


IEEE Transactions on Power Systems


31


99


798 - 801


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.


Data61; NICTA


https://doi.org/10.1109/TPWRS.2015.2407363


English


nicta:8639


Lehmann, Karsten; Grastien, Alban; Van Hentenryck, Pascal. AC-Feasibility on Tree Networks is NP-Hard. IEEE Transactions on Power Systems. 2015-03-18; 31(99):798 - 801. https://doi.org/10.1109/TPWRS.2015.2407363



Loading citation data...

Citation counts
(Requires subscription to view)