Please use this identifier to cite or link to this item: http://localhost:8081/xmlui/handle/123456789/6185
Full metadata record
DC FieldValueLanguage
dc.contributor.authorAhmad, Syed Haroon-
dc.date.accessioned2014-10-12T09:27:59Z-
dc.date.available2014-10-12T09:27:59Z-
dc.date.issued1994-
dc.identifierM.Techen_US
dc.identifier.urihttp://hdl.handle.net/123456789/6185-
dc.guidePant, A. K.-
dc.guideSharma, J. D.-
dc.description.abstractA conventional way of solving large optimization problems, with all but one decoupled constraint,is to augment the objective function with the coupled constraint using the Lagrangian multiplier. Conventionally the method of finding this multiplier is long and iterative, taking up a lot of computational effort and time. For sensitivity studies, in power systems planning, this kind of problem will need to be solved very often. In this study a methodology has been proposed to replace the time consuming method of search for the optimal Lagrangian multiplier by a Feedforward Neural Network. The optimal value of the Lagrangian multiplier can be greatly help in problem decomposition, greatly reducing the number of variables in each subproblem. A Feedforward Neural Network has been trained using the Backpropaga.tion Algorithm. This network has the right hand side constraint values as its inputs and the optimal value of the Lagrangian multiplier A as its output. So it represents the complex mapping of different constraints to the corresponding X.en_US
dc.language.isoenen_US
dc.subjectELECTRICAL ENGINEERINGen_US
dc.subjectNEURAL NETWORK APPROACHen_US
dc.subjectMULTIPERIOD PLANNINGen_US
dc.subjectBACK PROPAGATION ALGORITHMen_US
dc.titleNEURAL NETWORK APPROACH TO MULTIPERIOD PLANNING PROBLEMSen_US
dc.typeM.Tech Dessertationen_US
dc.accession.number246618en_US
Appears in Collections:MASTERS' THESES (Electrical Engg)

Files in This Item:
File Description SizeFormat 
246618EE.pdf2.2 MBAdobe PDFView/Open


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