Recognition: unknown
AC-Feasibility on Tree Networks is NP-Hard
classification
💻 cs.CC
math.OC
keywords
networkstreeac-feasibilitynp-hardconditionsconeconvexdemand
read the original abstract
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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.