A constrained load flow using convex structure (modified algorithm)

Abstract

This paper presents a method to solve constrained load-flow problems in which the constraint domained is determined by upper and lower bounds of active power, reactive power, and voltage. Three methods are presented that attempt to find convergent solutions to load-flow problems. The three methods are: 1. linear programming method, 2. convex quadratic programming method, 3. mixed method. For the mixed programming method, the linear programming method is used first, followed by convex quadratic programming if the convergence speed of the linear programming method has slowed down. The proposed methods are based on the simplex method which is used widely for linear programming and quadratic programming. The validity of the proposed methods are verified by numerical examples and the results obtained by the proposed methods are compared with those by the Newton-Raphson method.