Exact Convex Relaxation of Optimal Power Flow in Radial Networks

DOI10.1109/TAC.2014.2332712MaRDI QIDQ2982880zbMATH OpenOpenAlexFDO

Authors Lingwen Gan, Na Li, Ufuk Topcu, Steven H. Low

Publication date 16 May 2017

Published in IEEE Transactions on Automatic Control (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1311.7170

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Nonconvex programming, global optimization (90C26) Programming involving graphs or networks (90C35)

Abstract: The optimal power flow (OPF) problem determines power generation/demand that minimize a certain objective such as generation cost or power loss. It is nonconvex. We prove that, for radial networks, after shrinking its feasible set slightly, the global optimum of OPF can be recovered via a second-order cone programming (SOCP) relaxation under a condition that can be checked a priori. The condition holds for the IEEE 13-, 34-, 37-, 123-bus networks and two real-world networks, and has a physical interpretation.

Cited in

(24)

• Globally solving a class of optimal power flow problems in radial networks by tree reduction
• On supply-function equilibria in radial transmission networks
• Stochastic second-order-cone complementarity problems: expected residual minimization formulation and its applications
• Expected residual minimization formulation for a class of stochastic linear second-order cone complementarity problems
• Graphical models for optimal power flow
• A survey on conic relaxations of optimal power flow problem
• Electrical flows over spanning trees
• A new complementarity function and applications in stochastic second-order cone complementarity problems
• An overview of semidefinite relaxations for optimal power flow problem
• An alternating trust region algorithm for distributed linearly constrained nonlinear programs, application to the optimal power flow problem
• A Riemannian optimization approach to the radial distribution network load flow problem
• Approximations for generalized unsplittable flow on paths with application to power systems optimization
• A low-rank coordinate-descent algorithm for semidefinite programming relaxations of optimal power flow
• Combinatorial Optimization of AC Optimal Power Flow With Discrete Demands in Radial Networks
• A fluid model of an electric vehicle charging network
• Optimal power flow in distribution networks under N- 1 disruptions: a multistage stochastic programming approach
• Critical behaviour in charging of electric vehicles
• Two-stage stochastic optimization for optimal power flow under renewable generation uncertainty
• Convex Relaxation of Optimal Power Flow—Part I: Formulations and Equivalence
• A tight compact quadratically constrained convex relaxation of the optimal power flow problem
• Distributed dual subgradient methods with averaging and applications to grid optimization
• An inexact semismooth Newton SAA-based algorithm for stochastic nonsmooth SOC complementarity problems with application to a stochastic power flow programming problem
• Column generation for multistage stochastic mixed-integer nonlinear programs with discrete state variables
• Chance-constrained robust dynamic OPF in mutually coupled distribution networks with uncertain injections

This page was built for publication: Exact Convex Relaxation of Optimal Power Flow in Radial Networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2982880)