Linear-programming-based decomposition method for optimal planning of transmission network investments

Abstract

The paper is devoted to an optimal solution of the investment model within overall transmission network expansion planning. The proposed investment model is defined as the static, minimum-cost linear-programming problem. Adequate rearrangement of this model achieves its decomposition into two interrelated subproblems. The first subproblem deals with the solution of initial power flows encompassing security aspects only, and the second subproblem solves superimposed power flows taking into account the economy of the problem as well. The minimum-load curtailment 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 incorporated into the newly developed, very flexible procedure for overall transmission network expansion planning, which enables the application of different expansion planning concepts.