Transmission-security constrained optimal dispatch scheduling using generalized Benders decomposition

For the secure power system operation, we introduce a decomposition technique that separates a transmission-security constrained dispatch scheduling problem into a master problem (MP) and several subproblems (SPs) using Benders decomposition. The MP solves a general optimal power flow (OPF) problem while the SPs inspect the feasibility of OPF solution under respective transmission line contingencies. If a dispatch scheduling solution given by the MP violates transmission-security constraints, then additional constraints corresponding to the violations are imposed to the MP. Through this iterative process between the MP and SPs, we derive an optimal dispatch schedule incorporating the post-contingency corrective rescheduling. Numerical example demonstrates efficiency of the proposed approach.