Referenced Items are not available for this document.
An algorithm to obtain an approximate optimal solution to the problem of large-scale radial distribution system planning is proposed. The distribution planning problem is formulated as a MIP (mixed integer programming) problem. The set of constraints is reduced to a set of continuous variable linear equations by using the fact that the basis of the simplex tableau consists of the power flow variables of radial branch. This linear problem is solved by pivot operations which correspond to a branch-exchange of the radial network. Numerical examples are presented to demonstrate the validity and effectiveness of the algorithm
Published in:
Power Systems, IEEE Transactions on
(Volume:5
,
Issue:
1
)
Date of Publication: Feb 1990
- Page(s):
- 126 - 132
- ISSN :
- 0885-8950
- INSPEC Accession Number:
- 3631962
- Digital Object Identifier :
- 10.1109/59.49096
- Product Type:
- Journals & Magazines
- Date of Current Version :
- 06 August 2002
- Issue Date :
- Feb 1990
- Sponsored by :
- IEEE Power & Energy Society
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 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
