Modeling and Computation of Security-constrained Economic Dispatch with Multi-stage Rescheduling

Economic dispatch is a critical part of electricity planning and 
operation. Enhancing the dispatch problem to improve its robustness 
in the face of equipment failures or other contingencies is standard 
practice, but extremely time intensive, leading to restrictions on 
the richness of scenarios considered. We model post-contingency 
corrective actions in the security-constrained economic dispatch 
and consider multiple stages of rescheduling to meet different 
security constraints. The resulting linear program is not solvable
by traditional LP methods due to its large size. We devise and 
implement a series of algorithmic enhancements based on the Benders'
decomposition method to ameliorate the computational difficulty.
In addition, we propose a set of online measures to diagnose
and correct infeasibility issues encountered in the solution process.

The overall solution approach is able to process the ``N-1'' 
contingency list in ten minutes for all large network cases
available for experiments. Extensions to the nonlinear setting will 
be discussed via a semidefinite relaxation.