DocumentCode
69570
Title
Exact Convex Relaxation of Optimal Power Flow in Radial Networks
Author
Lingwen Gan ; Na Li ; Topcu, Ufuk ; Low, S.H.
Author_Institution
Eng. & Appl. Sci. Div., California Inst. of Technol., Pasadena, CA, USA
Volume
60
Issue
1
fYear
2015
fDate
Jan. 2015
Firstpage
72
Lastpage
87
Abstract
The optimal power flow (OPF) problem determines a network operating point that minimizes a certain objective such as generation cost or power loss. It is nonconvex. We prove that a global optimum of OPF can be obtained by solving a second-order cone program, under a mild condition after shrinking the OPF feasible set slightly, for radial power networks. The condition can be checked a priori, and holds for the IEEE 13, 34, 37, 123-bus networks and two real-world networks.
Keywords
IEEE standards; load flow; IEEE 123-bus networks; IEEE 13-bus networks; IEEE 34-bus networks; IEEE 37-bus networks; OPF problem; convex relaxation; generation cost; optimal power flow; power loss; radial networks; radial power networks; second-order cone program; Approximation methods; Equations; Mathematical model; Reactive power; Silicon; Substations; Upper bound; Optimal power flow (OPF);
fLanguage
English
Journal_Title
Automatic Control, IEEE Transactions on
Publisher
ieee
ISSN
0018-9286
Type
jour
DOI
10.1109/TAC.2014.2332712
Filename
6843918
Link To Document