LINEAR-PROGRAMMING-BASED DECOMPOSITION METHOD FOR OPTIMAL PLANNING OFTRANSMISSION NETWORK INVESTMENTS

The paper is devoted to an optimal solution of the investment model wi thin overall transmission network expansion planning. The proposed inv estment model is defined as the static, minimum-cost linear-programmin g problem. Adequate rearrangement of this model achieves its decomposi tion into two interrelated subproblems. The first subproblem deals wit h the solution of initial power flows encompassing security aspects on ly, and the second subproblem solves superimposed power flows taking i nto account the economy of the problem as well. The minimum-load curta ilment model is used for the solution of the first subproblem, and the proposed model of linear-programming marginal network is used for the solution of the second subproblem. The proposed investment model is i ncorporated into the newly developed, very flexible procedure for over all transmission network expansion planning, which enables the applica tion of different expansion planning concepts.