Geometry of Power Flows and Optimization in Distribution Networks
Javad Lavaei, David Tse, Baosen Zhang

TL;DR
This paper explores the geometric structure of power injection regions in tree distribution networks, demonstrating how convex relaxations can efficiently solve optimal power flow problems under practical conditions.
Contribution
It introduces a novel geometric analysis of injection regions, showing convexification preserves Pareto-optimal points and enables efficient optimization without previous restrictive assumptions.
Findings
Convex hull of Pareto-optimal points remains unchanged under practical angle conditions.
Convex relaxations like SDP and SOCP can efficiently solve the power flow optimization.
Results ensure solution uniqueness and non-negative locational marginal prices.
Abstract
We investigate the geometry of injection regions and its relationship to optimization of power flows in tree networks. The injection region is the set of all vectors of bus power injections that satisfy the network and operation constraints. The geometrical object of interest is the set of Pareto-optimal points of the injection region. If the voltage magnitudes are fixed, the injection region of a tree network can be written as a linear transformation of the product of two-bus injection regions, one for each line in the network. Using this decomposition, we show that under the practical condition that the angle difference across each line is not too large, the set of Pareto-optimal points of the injection region remains unchanged by taking the convex hull. Moreover, the resulting convexified optimal power flow problem can be efficiently solved via }{ semi-definite programming or second…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
