Optimal corrective rescheduling for real and reactive power control

Abstract

This paper presents a fast and reliable network security control algorithm to reschedule real and reactive power flow in an optimal manner. The aim of the rescheduling algorithm is to bring a power system operating with constraint violations into an ‘acceptable target state’ (ATS), with no constraint violations, and with minimum departure from the current control variables. Constraint violations caused by improper distribution of real power and/or reactive power are eliminated. Linear formulation using Dual Simplex linear programming with a relaxation technique is used, and complete decoupling between real and reactive power control is considered. Different types of constraint violations are eliminated by coordinating the real and reactive power control subalgorithms. The method is illustrated on two IEEE standard power systems.