A homogeneous linear programming algorithm for the security constrained economic dispatch problem

Abstract

This paper presents a study of the simplified homogeneous and self-dual (SHSD) linear programming (LP) interior point algorithm applied to the security constrained economic dispatch (SCED) problem. Unlike other interior point SCED applications that consider only the N security problem, this paper considers both (N-1) and (N-2) network security conditions. An important feature of the optimizing interior point LP algorithm is that it can detect infeasibility of the SCED problem reliably. This feature is particularly important in SCED applications since line overloading following a contingency often results in an infeasible schedule. The proposed method is demonstrated on the IEEE 24 bus test system and a practical 175 bus network. A comparison is carried out with the predictor-corrector interior point algorithm for the SCED problem presented previously (see ibid., vol. 12, no.2, p.803-10, 1997).