DSpace Repository

OPTIMA. NETWORK EXPANSION

Show simple item record

dc.contributor.author Shabad, Ram
dc.date.accessioned 2014-12-01T04:28:45Z
dc.date.available 2014-12-01T04:28:45Z
dc.date.issued 1976
dc.identifier M.Tech en_US
dc.identifier.uri http://hdl.handle.net/123456789/12338
dc.guide Dave, H. P.
dc.description.abstract Startinj 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.iso en en_US
dc.subject ELECTRICAL ENGINEERING en_US
dc.subject OPTIMA NETWORK EXPANSION en_US
dc.subject POWER SYSTEM DESIGN en_US
dc.subject ELECTRICAL NETWORK en_US
dc.title OPTIMA. NETWORK EXPANSION en_US
dc.type M.Tech Dessertation en_US
dc.accession.number 109485 en_US


Files in this item

This item appears in the following Collection(s)

Show simple item record