2000 character limit reached
Convex Relaxations and Linear Approximation for Optimal Power Flow in Multiphase Radial Networks
Published 11 Jun 2014 in math.OC | (1406.3054v1)
Abstract: Distribution networks are usually multiphase and radial. To facilitate power flow computation and optimization, two semidefinite programming (SDP) relaxations of the optimal power flow problem and a linear approximation of the power flow are proposed. We prove that the first SDP relaxation is exact if and only if the second one is exact. Case studies show that the second SDP relaxation is numerically exact and that the linear approximation obtains voltages within 0.0016 per unit of their true values for the IEEE 13, 34, 37, 123-bus networks and a real-world 2065-bus network.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.