Linear Programming Based Decomposition Method for Optimal Planning of Transmission Networks Investments

Victor Levi, Milan Calovic

    Research output: Contribution to journalArticlepeer-review

    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 only, and the second subproblem solves superimposed power flows taking into account economy 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 prposed 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.
    Original languageEnglish
    Pages (from-to)516-522
    Number of pages7
    JournalIEE Proceedings: Generation, Transmission and Distribution
    Volume140
    Issue number6
    Publication statusPublished - Nov 1993

    Keywords

    • Powe systems and plants; Linear programming; Transmission network expansion planning

    Fingerprint

    Dive into the research topics of 'Linear Programming Based Decomposition Method for Optimal Planning of Transmission Networks Investments'. Together they form a unique fingerprint.

    Cite this