Load-Flow Solvability under Security Constraints in DC Distribution Networks

TL;DR

This paper establishes conditions for the solvability of load-flow equations in DC distribution networks with security constraints and demonstrates a convex optimization approach to find solutions.

Contribution

It provides new sufficient conditions for load-flow solvability under security constraints and introduces a convex optimization method to obtain solutions.

Findings

Sufficient conditions for load-flow solvability are identified.

A convex optimization approach can find security-constrained load-flow solutions.

The method ensures reliable operation within security limits.

Abstract

We present sufficient conditions for the load-flow solvability under security constraints in DC distribution networks. In addition, we show that a load-flow solution that fulfills security constraints can be obtained via a convex optimization.