Journal
IEEE TRANSACTIONS ON POWER SYSTEMS
Volume 31, Issue 1, Pages 798-801Publisher
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TPWRS.2015.2407363
Keywords
Computational complexity; optimal power flow (OPF)
Categories
Funding
- Australian Government
- Australian Research Council through the ICT Centre of Excellence program
Ask authors/readers for more resources
Recent years have witnessed significant interest in convex relaxations of the power flows, with 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.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available
Share Paper
