Please use this identifier to cite or link to this item: http://localhost:8081/xmlui/handle/123456789/4741
Full metadata record
DC FieldValueLanguage
dc.contributor.authorKumar, Mukesh-
dc.date.accessioned2014-10-07T11:49:26Z-
dc.date.available2014-10-07T11:49:26Z-
dc.date.issued1994-
dc.identifierM.Techen_US
dc.identifier.urihttp://hdl.handle.net/123456789/4741-
dc.guideBhatia, P. K.-
dc.guideYoganarasimhan, G. N.-
dc.description.abstractA solution approach via dynamic programming for sequencing of a finite set of capacity expansion projects for electricity generation, that minimizes total discounted operating and investment costs, is attempted. This study is aimed . at developing a simple realistic solution methodology, for analysing optimal scheduling problems. The complexity of selection and timing of generation plant additions in a hydrothermal system with basically different types of generating units such as hydroelectric, steam,. diesel and gas turbine units are brought out. Various dynamic programming computation approaches suggested for solving the problem are critically reviewed. A bounded operation cost, quantized state methodology to reduce the complexity and computational time has been evolved and illustrated through a computational case study.en_US
dc.language.isoenen_US
dc.subjectWATER RESOURCES DEVELOPMENT AND MANAGEMENTen_US
dc.subjectOPTIMAL SCHEDULINGen_US
dc.subjectPOWER PROJECTSen_US
dc.subjectPLANNING HORIZONen_US
dc.titleOPTIMAL SCHEDULING OF POWER'. PROJECTS OVER A PLANNING HORIZONen_US
dc.typeM.Tech Dessertationen_US
dc.accession.number247021en_US
Appears in Collections:MASTERS' THESES (WRDM)

Files in This Item:
File Description SizeFormat 
WRDM247021.pdf4.65 MBAdobe PDFView/Open


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