Exact Convex Relaxation of Optimal Power Flow in Radial Networks

Journal Article · Thu Jan 01 00:00:00 EST 2015 · IEEE Transactions on Automatic Control

DOI:https://doi.org/10.1109/TAC.2014.2332712· OSTI ID:1211405

Gan, LW; Li, N; Topcu, U; Low, SH

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.

• Sponsoring Organization: USDOE Advanced Research Projects Agency - Energy (ARPA-E)
• DOE Contract Number: DE-AR0000226
• OSTI ID: 1211405
• Journal Information: IEEE Transactions on Automatic Control, Vol. 60, Issue 1; ISSN 0018-9286
• Country of Publication: United States
• Language: English