Security-Constrained Optimal Power Flow with Post-Contingency Corrective Rescheduling

This paper describes a mathematical framework for the solution of the economic dispatch problem with security constraints, which can take into account the system corrective capabilities after the outage has occurred. The solution algorithm is based on mathematical programming decomposition techniques that allow the iterative solution of a "base-case" economic dispatch and separate contingency analysis with generation rescheduling to eliminate constraint violations. The resulting dispatch has the same security level as the usual security-constrained dispatch, but with lower operating costs. Case studies with the IEEE 118-bus are presented. The extension of the methodology to the probabilistic case will be discussed in a forthcoming paper.