Strong NP-hardness of AC power flows feasibility
Daniel Bienstock, Abhinav Verma
TL;DR
This paper proves that determining the feasibility of AC power flows is strongly NP-hard, indicating significant computational complexity in solving such power system problems.
Contribution
It provides a rigorous proof establishing the strong NP-hardness of the AC-OPF problem, a fundamental issue in power system optimization.
Findings
AC-OPF problem is strongly NP-hard
Computational complexity implications for power system optimization
No efficient algorithms are likely to solve all instances quickly
Abstract
We present a rigorous proof of strong NP-hardness of the AC-OPF problem.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.