A semi-infinite programming algorithm for dynamic security-constrained generation rescheduling

Preventive control or remedial actions should be taken if dynamic instability for a contingency is detected. Generation rescheduling is an effective means to enhance security of power systems. A novel methodology, based on semi-infinite programming (SIP) techniques, is presented here for dynamic security- constrained generation rescheduling. Generation rescheduling is modeled as an OPF-like problem with dynamic security constraints for credible contingencies. The OPF problem is, mathematically, a SIP problem with infinite-dimensional constraints representing transient stability limits. Local reduction based on infinite norm of the violated constraints is proposed to replace the infinite constraints with finite constraints and makes the SIP problem solvable for finite standard programming method. Case study on the New England 39-bus system showed that the proposed model and approach is practical and effective. (5 pages)