Exact Convex Relaxation of Optimal Power Flow in Radial Networks
2014; Institute of Electrical and Electronics Engineers; Volume: 60; Issue: 1 Linguagem: Inglês
10.1109/tac.2014.2332712
ISSN2334-3303
AutoresLingwen Gan, Na Li, Ufuk Topcu, Steven H. Low,
Tópico(s)Microgrid Control and Optimization
ResumoThe 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.
Referência(s)