Cart (Loading....) | Create Account
Close category search window
 

Transmission Expansion by Branch-and-Bound Integer Programming with Optimal Cost - Capacity Curves

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)

A new method is proposed in this paper to solve a single-stage expansion problem for a transmission network, given future generation and load patterns, and alternative types of lines available, subject to overload, reliability and right-of-way constraints. The problem is formulated as a series of zero-one integer programs which are solved by an efficient branch-and-bound algorithm. Complexity is reduced by the concepts of optimal cost-capacity curves and screening algorithms. A sample study is shown and the method is implemented in a computer program.

Published in:

Power Apparatus and Systems, IEEE Transactions on  (Volume:PAS-93 ,  Issue: 5 )

Date of Publication:

Sept. 1974

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.