No abstract

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 of this problem is reduced to a set of continuous variable linear eguatians 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 correspold to a branch-exchange of the radial network. Numerical examples are presented to demonstrate the validity and effectiveness of the algorithm.

No abstract

No abstract