MULTIAREA ECONOMIC-DISPATCH WITH TIE LINE CONSTRAINTS

This paper presents a new method for solving the Multi-Area Economic Dispatch (MAED) problem with tie line constraints, This formulation extends the traditional economic dispatch methods used in study applications such as Unit Commitment to include area demand constraints, area reserve constraints, and tie line capacity constraints between the modeled areas. The MAED is formulated as a capacitated nonlinear network flow problem which is solved using a high-speed network-flow code. The MAED determines the amount of power that can be economically generated in one area and transferred to another area to displace generation in the second area. The network flow model does not compute the actual power transfer between areas. The paper demonstrates that a significant number of the problem constraints may be formulated as network-type, and as a result, the method provides a robust, high-speed solution method for surprisingly large class of utility problems including the ability to analyze potential purchases and sales in a multi-area environment.