Sparse Reactive Power Scheduling by a Penalty Function - Linear Programming Technique

This work presents a linear programming based algorithm to solve reactive power dispatch problems. A mixed set of variables (generated voltages and reactive power injections) and the reactive power model of the fast decoupled load flow algorithm are used to derive linear sensitivities. A suitable criterion is suggested to form a sparse reactive power sensitivity matrix. The sparse sensitivity matrix is in turn modeled as a bipartite graph which is used to define an efficient constraint relaxation strategy to solve linearized reactive power dispatch problems. The penalty function - linear programming technique method is used in a complete reactive power dispatch solution algorithm, the performance of which is discussed by solving a 256-node, 58 control-variable test system.