Decoupled Optimal Load Flow Using Linear or Quadratic Programming

Abstract

The Optimal Load Flow problem is a constrained optimization problem of large size and great complexity. For on-line implementation fast execution times and minimum computer storage are required. The proposed iterative scheme, reported in this paper, decomposes the Optimal Load Flow problem into real and reactive subproblems. At each iteration the two subproblems are solved using quadratic programming. If the valve point loading is to be considered, the two subproblems are solved using linear programming. In our scheme, linearization of the non-linear constraints of the problem is succeeded by utilizing Z-matrix techniques and sensitivity analysis.