Please use this identifier to cite or link to this item: https://scholarbank.nus.edu.sg/handle/10635/54530
DC FieldValue
dc.titleA new model and algorithm of secure and economic automatic generation control
dc.contributor.authorZhu, J.Z.
dc.contributor.authorChang, C.S.
dc.contributor.authorXu, G.Y.
dc.date.accessioned2014-06-16T09:32:07Z
dc.date.available2014-06-16T09:32:07Z
dc.date.issued1998-05
dc.identifier.citationZhu, J.Z., Chang, C.S., Xu, G.Y. (1998-05). A new model and algorithm of secure and economic automatic generation control. Electric Power Systems Research 45 (2) : 119-127. ScholarBank@NUS Repository.
dc.identifier.issn03787796
dc.identifier.urihttps://scholarbank.nus.edu.sg/handle/10635/54530
dc.description.abstractThis paper presents a new nonlinear convex network flow programming (NLCNFP) model and algorithm for solving the on-line economic power dispatch and automatic generation control (AGC) with security and economy. Two AGC functions - load frequency control (LFC) and economic dispatch control (EDC) are modeled on the same timescale as EDC. This new AGC modeling and solution algorithm meets not only the control requirement of frequency and tie-line power as in the conventional load frequency control, but also the line security and system economy. The proposed approach is tested on an IEEE 30-bus system with satisfactory results. © 1998 Elsevier Science S.A. All rights reserved.
dc.sourceScopus
dc.subjectAutomatic generation control
dc.subjectConvex network flow programming
dc.subjectEconomic dispatch control
dc.subjectLoad frequency control
dc.subjectQuadratic programming
dc.typeArticle
dc.contributor.departmentELECTRICAL ENGINEERING
dc.description.sourcetitleElectric Power Systems Research
dc.description.volume45
dc.description.issue2
dc.description.page119-127
dc.description.codenEPSRD
dc.identifier.isiutNOT_IN_WOS
Appears in Collections:Staff Publications

Show simple item record
Files in This Item:
There are no files associated with this item.

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.