By Topic

Convexification of optimal power flow problem

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Javad Lavaei ; Department of Control and Dynamical Systems, California Institute of Technology, USA ; Steven H. Low

The optimal power flow (OPF) problem is nonconvex and generally hard to solve. We provide a sufficient condition under which the OPF problem is equivalent to a convex problem and therefore is efficiently solvable. Specifically, we prove that the dual of OPF is a semidefinite program and our sufficient condition guarantees that the duality gap is zero and a globally optimal solution of OPF is recoverable from a dual optimal solution. This sufficient condition is satisfied by standard IEEE benchmark systems with 14, 30, 57, 118 and 300 buses after small resistance (10-5 per unit) is added to every transformer that originally assumes zero resistance. We justify why the condition might hold widely in practice from algebraic and geometric perspectives. The main underlying reason is that physical quantities such as resistance, capacitance and inductance, are all positive.

Published in:

Communication, Control, and Computing (Allerton), 2010 48th Annual Allerton Conference on

Date of Conference:

Sept. 29 2010-Oct. 1 2010