A Caltech Library Service

Exact Convex Relaxation for Optimal Power Flow in Distribution Networks

Gan, Lingwen and Li, Na and Low, Steven H. and Topcu, Ufuk (2013) Exact Convex Relaxation for Optimal Power Flow in Distribution Networks. In: SIGMETRICS '13 Proceedings of the ACM SIGMETRICS/international conference on Measurement and modeling of computer systems. ACM , New York, NY, pp. 351-352. ISBN 978-1-4503-1900-3.

PDF - Submitted Version
See Usage Policy.


Use this Persistent URL to link to this item:


The optimal power flow (OPF) problem seeks to control the power generation/consumption to minimize the generation cost, and is becoming important for distribution networks. OPF is nonconvex and a second-order cone programming (SOCP) relaxation has been proposed to solve it. We prove that after a "small" modification to OPF, the SOCP relaxation is exact under a "mild" condition. Empirical studies demonstrate that the modification to OPF is "small" and that the "mild" condition holds for all test networks, including the IEEE 13-bus test network and practical networks with high penetration of distributed generation.

Item Type:Book Section
Related URLs:
URLURL TypeDescription
Low, Steven H.0000-0001-6476-3048
Additional Information:Copyright is held by the author/owner(s).
Subject Keywords:optimal power flow, second-order cone programming, exact convex relaxation
Classification Code:J.2 [Physical Science and Engineering]: Engineering
Record Number:CaltechAUTHORS:20131008-160444682
Persistent URL:
Usage Policy:No commercial reproduction, distribution, display or performance rights in this work are provided.
ID Code:41766
Deposited On:08 Oct 2013 23:19
Last Modified:10 Nov 2021 04:34

Repository Staff Only: item control page