Multi-area power systems economic dispatch using nonlinear convex network flow programming

Abstract

Abstract This paper presents a new nonlinear convex network flow programming (NLCNFP) model and algorithm for solving the security-constrained multi-area economic dispatch (MAED) problem. The tie-line security and transfer constraints in each area are considered in the MAED model. A simple analysis of a buying and selling contract in a multi-area environment is also made. The NLCNFP model of security-constrained multi-area economic dispatch was set up and solved by using a combined method of quadratic programming (QP) and network flow programming (NFP). The concept of maximum basis in the network flow graph was introduced to change the constrained model into an unconstrained QP model, which was easily solved by the reduced gradient method. The proposed approach is tested on a system of four interconnected areas with satisfactory results.