Non-convex security constrained optimal power flow by a new solution method composed of Benders decomposition and special ordered sets.

SUMMARY This paper presents a comprehensive formulation for the security constrained optimal power flow (SCOPF) problem considering valve loading effect, multiple fuel option, and prohibited operating zones of units as well as alternating current network modeling and contingency constraints. Also, the SCOPF formulation includes the integer variables, such as discrete transformer tap settings, in addition to continuous variables, such as generation of units. Thus, the suggested SCOPF model is a mixed integer, nonlinear, non-convex, and non-smooth optimization problem. To solve this problem, a new solution method composed of Benders decomposition and special ordered sets is presented. The proposed formulation decomposes the problem into a master problem and a sub-problem. The master problem relaxes the nonlinear constraints of the model using a convex linear outer approximation based on the concept of special ordered sets, whereas the sub-problem contains the nonlinear and non-convex SCOPF formulation with fixed integer and binary variables. To show the effectiveness of the proposed solution method, it is tested on the well-known test systems and compared with several other recently published solution methods. These comparisons confirm the validity of the developed approach. Copyright © 2013 John Wiley & Sons, Ltd. [ABSTRACT FROM AUTHOR]