Please use this identifier to cite or link to this item: http://localhost:8081/jspui/handle/123456789/12305
Full metadata record
DC FieldValueLanguage
dc.contributor.authorBhowmik, A.-
dc.date.accessioned2014-11-30T10:13:01Z-
dc.date.available2014-11-30T10:13:01Z-
dc.date.issued1974-
dc.identifierM.Techen_US
dc.identifier.urihttp://hdl.handle.net/123456789/12305-
dc.guideSwamee, P. K.-
dc.guidePant, A. K.-
dc.description.abstractThe water distribution network design problebi is to find the optimal set of investments in pie lines and appurtenant works that are needed to satisfy the water requirements. An algorithm for optimal design of Water distribution system consisting of a single pipe line with multiple intermediate withdrawls,, constituting tto demand patterns one for peak hours and the other for noxi-peak hour has been developed in the present investigations.• The strategy of this study has been to formulate a mathematical model for solving the optimal investment problem, which lead to a non-linear objective function with non-linear const-raints. A closed form solution of the problem has been obtained by the Lagrangian multiplier method. The solution provided optimal pipe diameters, pumping heads, height of the tank, and the minimal cos ~• For the case of continuous withdrawl a system of integral equations has been formulated and an algorithm I presented herein. A case of pipe line having six withdrawals has been studied. The influence of parameters such as peak hours and peaking factor has been shown graphically.en_US
dc.language.isoenen_US
dc.subjectELECTRICAL ENGINEERINGen_US
dc.subjectWATER SUPPLY MAINen_US
dc.subjectTWO DEMAND PATTERNSen_US
dc.subjectWATER DISTRBUTION NETWORKen_US
dc.titleOPTIMIZATION OF A WATER SUPPLY MAIN WITH TWO DEMAND PATTERNSen_US
dc.typeM.Tech Dessertationen_US
dc.accession.number108208en_US
Appears in Collections:MASTERS' THESES (Electrical Engg)

Files in This Item:
File Description SizeFormat 
EED108208.pdf1.61 MBAdobe PDFView/Open


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