A Caltech Library Service

Exact Convex Relaxation of Optimal Power Flow in Radial Networks

Gan, Lingwen and Li, Na and Topcu, Ufuk and Low, Steven H. (2015) Exact Convex Relaxation of Optimal Power Flow in Radial Networks. IEEE Transactions on Automatic Control, 60 (1). pp. 72-87. ISSN 0018-9286. doi:10.1109/TAC.2014.2332712.

[img] PDF - Submitted Version
See Usage Policy.


Use this Persistent URL to link to this item:


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.

Item Type:Article
Related URLs:
URLURL TypeDescription DOIArticle Paper
Low, Steven H.0000-0001-6476-3048
Additional Information:© 2014 IEEE. Manuscript received March 20, 2013; revised November 19, 2013, March 13, 2014, and May 26, 2014; accepted May 27, 2014. Date of publication June 25, 2014; date of current version December 22, 2014. This work was supported by NSF NetSE grant CNS 0911041, ARPA-E grant DE-AR0000226, Southern California Edison, National Science Council of Taiwan, grant NSC 103-3113-P-008-001, Los Alamos National Lab through a DoE grant, Resnick Institute, and AFOSR award FA9550-12-1-0302. Recommended by Associate Editor C. M. Lagoa.
Group:Resnick Sustainability Institute
Funding AgencyGrant Number
Department of Energy (DOE)DE-AR0000226
Southern California EdisonUNSPECIFIED
National Science Council (Taipei)NSC 103-3113-P-008-001
Los Alamos National LabUNSPECIFIED
Resnick Sustainability InstituteUNSPECIFIED
Air Force Office of Scientific Research (AFOSR)FA9550-12-1-0302
Subject Keywords:Optimal power flow (OPF)
Issue or Number:1
Record Number:CaltechAUTHORS:20150203-084513340
Persistent URL:
Official Citation:Lingwen Gan; Na Li; Topcu, U.; Low, S.H., "Exact Convex Relaxation of Optimal Power Flow in Radial Networks," Automatic Control, IEEE Transactions on , vol.60, no.1, pp.72,87, Jan. 2015 doi: 10.1109/TAC.2014.2332712 URL:
Usage Policy:No commercial reproduction, distribution, display or performance rights in this work are provided.
ID Code:54315
Deposited By: Tony Diaz
Deposited On:04 Feb 2015 04:00
Last Modified:10 Nov 2021 20:31

Repository Staff Only: item control page