Convex Restriction of Power Flow Feasibility Sets
arXiv:1803.00818 · doi:10.1109/TCNS.2019.2930896
Abstract
The convex restriction of the power flow feasible sets identifies the convex subset of power injections where the solution for power flow is guaranteed to exist and satisfy the operational constraints. In contrast to convex relaxations, the convex restriction provides a sufficient condition for power flow feasibility and is particularly useful for problems involving uncertainty in the power generation and demand. In this paper, we present a general framework of constructing convex restriction of an algebraic set defined by equality and inequality constraints and apply the framework to power flow feasibility problem. The procedure results in convex quadratic constraints that provide a sufficiently large region for practical operation of the grid.
References in corpus (6)
- JuMP: A Modeling Language for Mathematical Optimization
- Convex Relaxation of Optimal Power Flow, Part I: Formulations and Equivalence
- On the existence and linear approximation of the power flow solution in power distribution networks
- A New Voltage Stability-Constrained Optimal Power Flow Model: Sufficient Condition, SOCP Representation, and Relaxation
- Recent Advances in Computational Methods for the Power Flow Equations
- A Theory of Solvability for Lossless Power Flow Equations -- Part I: Fixed-Point Power Flow