期刊
IEEE TRANSACTIONS ON POWER SYSTEMS
卷 31, 期 1, 页码 798-801出版社
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TPWRS.2015.2407363
关键词
Computational complexity; optimal power flow (OPF)
资金
- Australian Government
- Australian Research Council through the ICT Centre of Excellence program
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.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据