Exact Convex Relaxation of Optimal Power Flow in Radial Networks

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 th...

Full description

Saved in:
Bibliographic Details
Published inIEEE transactions on automatic control Vol. 60; no. 1; pp. 72 - 87
Main Authors Lingwen Gan, Na Li, Topcu, Ufuk, Low, Steven H.
Format Journal Article
LanguageEnglish
Published New York IEEE 01.01.2015
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects
Online AccessGet full text

Cover

Loading…