Equivalent Relaxations of Optimal Power Flow

DOI10.1109/TAC.2014.2357112MaRDI QIDQ2982813zbMATH OpenFDO

Authors Subhonmesh Bose, Steven H. Low, Thanchanok Teeraratkul, B. Hassibi

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/1401.1876

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Quadratic programming (90C20) Semidefinite programming (90C22)

Abstract: Several convex relaxations of the optimal power flow (OPF) problem have recently been developed using both bus injection models and branch flow models. In this paper, we prove relations among three convex relaxations: a semidefinite relaxation that computes a full matrix, a chordal relaxation based on a chordal extension of the network graph, and a second-order cone relaxation that computes the smallest partial matrix. We prove a bijection between the feasible sets of the OPF in the bus injection model and the branch flow model, establishing the equivalence of these two models and their second-order cone relaxations. Our results imply that, for radial networks, all these relaxations are equivalent and one should always solve the second-order cone relaxation. For mesh networks, the semidefinite relaxation is tighter than the second-order cone relaxation but requires a heavier computational effort, and the chordal relaxation strikes a good balance. Simulations are used to illustrate these results.

Cited in

(15)

• Sequential feasible optimal power flow in power systems
• Completely positive and completely positive semidefinite tensor relaxations for polynomial optimization
• Power transmission network expansion planning: a semidefinite programming branch-and-bound approach
• A survey on conic relaxations of optimal power flow problem
• Distributed optimization of general linear multi-agent systems with external disturbance
• An overview of semidefinite relaxations for optimal power flow problem
• Convex Relaxation of Optimal Power Flow—Part I: Formulations and Equivalence
• Mathematical programming formulations for the alternating current optimal power flow problem
• Mathematical programming formulations for the alternating current optimal power flow problem
• Distributed resource allocation of second‐order nonlinear multiagent systems
• Predefined-time distributed optimization of general linear multi-agent systems
• Distributed event-triggered algorithm for optimal resource allocation of second-order multi-agent systems
• Distributed optimisation of second-order multi-agent systems by control algorithm using position-only interaction with time-varying delay
• Event-triggered gradient-based distributed optimisation for multi-agent systems with state consensus constraint
• Distributed coordination for a class of non-linear multi-agent systems with regulation constraints

This page was built for publication: Equivalent Relaxations of Optimal Power Flow

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