Optimal Reconfiguration of DC Networks.

In this paper, we consider the problem of optimizing voltage set points and switching status of components in direct current power networks subject to physical and security constraints. The problem is cast as a mixed-integer nonlinear programming with two sources of computational complexity: i) Non-convex power flow equations, and ii) The presence of binary variables accounting for the on/off status of network components. A strengthened second-order cone programming (SOCP) relaxation is developed to tackle the non-convexity of power flow equations, and a branch-and-bound search is employed for determining optimal network configurations. The efficacy of the proposed method in optimizing the operation while mitigating contingencies is experimentally validated in a real-time hardware-in-the-loop environment using IEEE benchmark data. [ABSTRACT FROM AUTHOR]