Reports

Strong NP-hardness of AC power flows feasibility

Bienstock, Daniel; Verma, Abhinav

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

Keywords: ACOPF, combinatorial optimization, NP-hardness

Files

More About This Work