A Caltech Library Service

Convexifying Optimal Power Flow: Recent Advances in OPF Solution Methods

Low, Steven and Gayme, Dennice and Topcu, Ufuk (2013) Convexifying Optimal Power Flow: Recent Advances in OPF Solution Methods. In: 2013 American Control Conference (ACC). IEEE , Piscataway, NJ, p. 5245. ISBN 978-1-4799-0177-7.

Full text is not posted in this repository. Consult Related URLs below.

Use this Persistent URL to link to this item:


The optimal power flow (OPF) problem is nonconvex and generally hard to solve, see e.g. [1], [2]. In this tutorial, we will provide an overview of two different solution approaches. The first uses the bus injection model, which is the standard model for power flow analysis and optimization. It focuses on nodal variables such as voltages, current and power injections and does not directly deal with power flows on individual branches. A key advantage is the simple linear relationship I = Y V between the nodal current injections I and the bus voltages V through the admittance matrix Y. Recently, it has been observed that this form of OPF can be reformulated as a nonconvex QCQP (quadratic constrained quadratic program), which leads to a standard convex relaxation through semidefinite programming [3]-[5]. For radial networks, different sufficient conditions have been derived under which the semidefinite relaxation turns out to be exact [6]-[8]. The second solution technique employs the branch flow model, which focuses on currents and powers on the branches rather than the nodal variables. The branch flow model has been historically used primarily for modeling distribution circuits, which tend to be radial. It has therefore received far less attention. A branch flow model has recently been proposed for the analysis and optimization of mesh as well as radial networks. The model leads to a new approach to solving OPF that consists of two relaxation steps. The first step eliminates the voltage and current angles and the second step approximates the resulting problem by a conic program that can be solved efficiently. For radial networks, both relaxation steps are always exact, provided there are no upper bounds on loads [9]. For mesh networks, the conic relaxation is always exact and we provide a simple way to determine if a relaxed solution is globally optimal. We describe a simple method to convexify a mesh network using phase shifters so that both relaxation steps are alw- ys exact and OPF for the convexified network can always be solved efficiently for a globally optimal solution. We prove that convexification requires phase shifters only outside a spanning tree of the network graph and their placement depends only on network topology, not on power flows, generation, loads, or operating constraints [10]. The tutorial will describe precisely the bus injection model and the semidefinite relaxation of OPF as well as the branch flow model and its associated relaxations. We prove sufficient conditions for exact relaxations and verify our results on simulations of various IEEE test systems. Finally we explain the equivalence between the bus injection model and branch flow model.

Item Type:Book Section
Related URLs:
URLURL TypeDescription
Low, Steven0000-0001-6476-3048
Additional Information:© 2013 AACC.
Other Numbering System:
Other Numbering System NameOther Numbering System ID
INSPEC Accession Number13809255
Record Number:CaltechAUTHORS:20131219-091842168
Persistent URL:
Official Citation:Low, S.; Gayme, D.; Topcu, U., "Convexifying optimal power flow: Recent advances in OPF solution methods," American Control Conference (ACC), 2013 , vol., no., pp.5245,5245, 17-19 June 2013 URL:
Usage Policy:No commercial reproduction, distribution, display or performance rights in this work are provided.
ID Code:43081
Deposited By: Tony Diaz
Deposited On:23 Dec 2013 20:04
Last Modified:09 Mar 2020 13:19

Repository Staff Only: item control page