Exact Convex Relaxation of Optimal Power Flow in Radial Networks

DOI10.1109/TAC.2014.2332712zbMath1360.90048arXiv1311.7170OpenAlexW3101868728MaRDI QIDQ2982880

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

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

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

Related Items (15)

Globally solving a class of optimal power flow problems in radial networks by tree reduction ⋮ A Fluid Model of an Electric Vehicle Charging Network ⋮ Optimal Power Flow in Distribution Networks Under N – 1 Disruptions: A Multistage Stochastic Programming Approach ⋮ A Riemannian optimization approach to the radial distribution network load flow problem ⋮ An alternating trust region algorithm for distributed linearly constrained nonlinear programs, application to the optimal power flow problem ⋮ 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 ⋮ Approximations for generalized unsplittable flow on paths with application to power systems optimization ⋮ Graphical models for optimal power flow ⋮ Critical behaviour in charging of electric vehicles ⋮ Two-stage stochastic optimization for optimal power flow under renewable generation uncertainty ⋮ A survey on conic relaxations of optimal power flow problem ⋮ A new complementarity function and applications in stochastic second-order cone complementarity problems ⋮ An overview of semidefinite relaxations for optimal power flow problem ⋮ Electrical flows over spanning trees

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