期刊
IEEE TRANSACTIONS ON POWER SYSTEMS
卷 28, 期 3, 页码 2554-2564出版社
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TPWRS.2013.2255317
关键词
Convex relaxation; load flow control; optimal power flow; phase control; power system management
资金
- NSF through NetSE grant [CNS 0911041]
- DoE's ARPA-E [DE-AR0000226]
- National Science Council of Taiwan (R. O. C.) [NSC 101-3113-P-008-001]
- SCE
- Resnick Institute of Caltech
- Cisco
- Okawa Foundation
We propose a branch flow model for the analysis and optimization of mesh as well as radial networks. The model leads to a new approach to solving optimal power flow (OPF) that consists of two relaxation steps. The first step eliminates the voltage and current angles and the second step approximates the resulting problem by a conic program that can be solved efficiently. For radial networks, we prove that both relaxation steps are always exact, provided there are no upper bounds on loads. For mesh networks, the conic relaxation is always exact but the angle relaxation may not be exact, and we provide a simple way to determine if a relaxed solution is globally optimal. We propose convexification of mesh networks using phase shifters so that OPF for the convexified network can always be solved efficiently for an optimal solution. We prove that convexification requires phase shifters only outside a spanning tree of the network and their placement depends only on network topology, not on power flows, generation, loads, or operating constraints. Part I introduces our branch flow model, explains the two relaxation steps, and proves the conditions for exact relaxation. Part II describes convexification of mesh networks, and presents simulation results.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据