Strong NP-hardness of AC power flows feasibility

We prove that testing feasibility for an AC power flow system is a strongly NP-hard problem.

Saved in:
Bibliographic Details
Published inOperations research letters Vol. 47; no. 6; pp. 494 - 501
Main Authors Bienstock, Daniel, Verma, Abhinav
Format Journal Article
LanguageEnglish
Published Elsevier B.V 01.11.2019
Subjects
Approximation algorithms
NP-completeness
Power flows
Approximation algorithms
Power flows
NP-completeness
Online AccessGet full text

Cover

More Information
Summary:We prove that testing feasibility for an AC power flow system is a strongly NP-hard problem.
ISSN:0167-6377
1872-7468
DOI:10.1016/j.orl.2019.08.009