Optimal power flow in tree networks

Abstract

The optimal power flow (OPF) problem seeks to control power generation/demand to optimize certain objectives such as minimizing the generation cost or power loss. It is becoming increasingly important for tree distribution networks due to the emerging distributed generation and controllable loads. The OPF problem is nonconvex. We prove that after modifying the OPF problem, its global optimum can be recovered via a second-order cone programming (SOCP) relaxation for tree networks, under a condition that can be checked in advance. Empirical studies justify that the modification is “small”, and that the condition holds, for the IEEE 13-bus network and two real-world networks.