Equivalent Relaxations of Optimal Power Flow

DOI10.1109/TAC.2014.2357112zbMath1360.90187arXiv1401.1876MaRDI QIDQ2982813

Subhonmesh Bose, Steven H. Low, Thanchanok Teeraratkul, Babak 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

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

Related Items (9)

Distributed resource allocation of second‐order nonlinear multiagent systems ⋮ Predefined-time distributed optimization of general linear multi-agent 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 ⋮ Mathematical programming formulations for the alternating current optimal power flow problem ⋮ Distributed optimization of general linear multi-agent systems with external disturbance ⋮ Mathematical programming formulations for the alternating current optimal power flow problem ⋮ An overview of semidefinite relaxations for optimal power flow problem

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