Exact Convex Relaxation of Optimal Power Flow in Radial Networks

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 th...

Full description

Saved in:
Bibliographic Details
Published inIEEE transactions on automatic control Vol. 60; no. 1; pp. 72 - 87
Main Authors Lingwen Gan, Na Li, Topcu, Ufuk, Low, Steven H.
Format Journal Article
LanguageEnglish
Published New York IEEE 01.01.2015
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects
Approximation methods
Automatic control
Cost engineering
Equations
Mathematical model
Networks
Optimization
Power flow
Power loss
Reactive power
Silicon
Substations
Upper bound
Optimal power flow (OPF)
Online AccessGet full text

Cover

More Information
Summary: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.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
content type line 23
DE-AR0000226
USDOE Advanced Research Projects Agency - Energy (ARPA-E)
ISSN:0018-9286
1558-2523
DOI:10.1109/TAC.2014.2332712