Please use this identifier to cite or link to this item: http://localhost:8081/jspui/handle/123456789/12338
Full metadata record
DC FieldValueLanguage
dc.contributor.authorShabad, Ram-
dc.date.accessioned2014-12-01T04:28:45Z-
dc.date.available2014-12-01T04:28:45Z-
dc.date.issued1976-
dc.identifierM.Techen_US
dc.identifier.urihttp://hdl.handle.net/123456789/12338-
dc.guideDave, H. P.-
dc.description.abstractStartinj with geographical positions of the substations, which are to be interconnected, it has been shown that a oat of equations can be obtained which are solvable by li.noar-programming techniques to obtain a minimum cost notriork design. Any security of supply conditions considered necessary can be incorporated into the design equations. One of the earliest proposals to formulate the criteria of power system design# in such a clay that the problea could be solved by an automatic optimisation process, was put forward by Knight2 in 1961. Ho used new r ethod of linear programming to minimise an economic objective function of the electrical network, subject to a set of linear inequd,lities representing security requirements. The next approach to the planning of electrical-power networks is mixed integer linear programming based on interpretation of fixed coot transportation-type models which include both network security and cost of network losses.en_US
dc.language.isoenen_US
dc.subjectELECTRICAL ENGINEERINGen_US
dc.subjectOPTIMA NETWORK EXPANSIONen_US
dc.subjectPOWER SYSTEM DESIGNen_US
dc.subjectELECTRICAL NETWORKen_US
dc.titleOPTIMA. NETWORK EXPANSIONen_US
dc.typeM.Tech Dessertationen_US
dc.accession.number109485en_US
Appears in Collections:MASTERS' THESES (Electrical Engg)

Files in This Item:
File Description SizeFormat 
EED109485.pdf3.64 MBAdobe PDFView/Open


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