Solving Security‐Constrained Optimal Power Flow with Benders Decomposition

ABSTRACT The security‐constrained optimal power flow problem solves for the optimal operation point of large electrical networks while maintaining secure operation in case of faults. It is thus important in the operation as well as the planning of transmission and distribution systems. This work uses Benders decomposition to solve for the optimal generator power and voltage setpoints under a large number of N‐1 security constraints. The comparison against a holistic formulation is made in terms of computational speed, robustness, and accuracy. While a holistic formulation is expected to be more efficient for small‐scale problems, there is a break‐even point in terms of the number of variables whereupon the Benders decomposition becomes more efficient. This work presents the nonlinear programs of the holistic formulation and Benders decomposition and shows numerical results of small networks with a large number of N‐1 security constraints.