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

Yan Xia, Ka Wing Chan, Fai Ho Ho

Research output: Chapter in book / Conference proceedingConference article published in proceeding or bookAcademic researchpeer-review

Abstract

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.
Original languageEnglish
Title of host publication7th IET International Conference on Advances in Power System Control, Operation and Management (APSCOM 2006)
Edition523 CP
DOIs
Publication statusPublished - 1 Dec 2006
Event7th IET International Conference on Advances in Power System Control, Operation and Management, APSCOM 2006 - Hong Kong, Hong Kong
Duration: 30 Oct 20062 Nov 2006

Conference

Conference7th IET International Conference on Advances in Power System Control, Operation and Management, APSCOM 2006
Country/TerritoryHong Kong
CityHong Kong
Period30/10/062/11/06

Keywords

  • Dynamic stability analysis
  • Generation rescheduling
  • Optimal power flow
  • Semi-infinite programming

ASJC Scopus subject areas

  • Electrical and Electronic Engineering

Cite this