Please use this identifier to cite or link to this item: http://localhost:8081/xmlui/handle/123456789/12463
Title: GENERATION ALLOCATION IN LARGE POWER SYSTEMS
Authors: Verma, Mahesh Chandra
Keywords: ELECTRICAL ENGINEERING;GENERATION ALLOCATION;LARGE POWER SYSTEMS;POWER SYSTEM
Issue Date: 1985
Abstract: Generation allocation problem is very important because of huge system operating costs with the increase in size and complexity* the simple criterion of 'equal incremDntal cost' operation of genera- tore does not give optimal operating conditions with desired accuracy and hence more sophisticated methods are now used to find the optimal flow of active and reactive power in the systems. In the present study« the active and reactive powers are allocated amongst the system sources such that the defined criterion is optimally satisfied. The criteria or the objectives for optimization could be total system operating cost# system losses to describe a delilbd behaviour of the system. The objective are optimized such that the system pourer flow equations and limit constrained imposed upon the variables by the system operating condition and design considerations are satisfied# Because of large number of variables and constrained involved# and both the objective function and constrained being non-linear, the problem is quite a challenging one from computational cons ide ration. To reduce the complexity and size of the problem we have made use of variable decomposition and problem decomposition approach. The complete problem of optimal generation happens to be a constrained non-linear programming problem. A now approach is suggested in this work to transform the constrained problem into Unconstrained one.
URI: http://hdl.handle.net/123456789/12463
Other Identifiers: M.Tech
Research Supervisor/ Guide: Gupta, H. O.
Sharma, J. D.
metadata.dc.type: M.Tech Dessertation
Appears in Collections:MASTERS' THESES (Electrical Engg)

Files in This Item:
File Description SizeFormat 
EED178123.pdf3.09 MBAdobe PDFView/Open


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