EFFICIENT SECURITY-CONSTRAINED OPTIMAL POWER FLOW (SC OPF) ANALYSIS USING CONVEXIFICATION OF CONTINUOS VARIABLE CONSTRAINTS WITHIN A BI-LEVEL DECOMPOSITION SCHEME

摘要

A scheme is presented that utilizes the convexification of continuous variables in the modeling of the Security-Constrained Optimal Power Flow (SC-OPF) problem to create discrete variables that allow for column-generation tools to be used in the solution of the SC OPF problem. One such relation is the voltage law relation for AC branch control flows, and the convexification utilizes a complex plane representation to create a convex solution of discrete values that can be used to perform a feasibility analysis of the various contingency cases. As a result of the convexification, analysis tools, such as column-generation decomposition associated with discrete variables are available for use in solving the SC OPF problem and increase the efficiency and accuracy of the solution.