A homogeneous linear programming algorithm for the securityconstrained economic dispatch problem

摘要

This paper presents a study of the simplified homogeneous andnself-dual (SHSD) linear programming (LP) interior point algorithmnapplied to the security constrained economic dispatch (SCED) problem.nUnlike other interior point SCED applications that consider only the Nnsecurity problem, this paper considers both (N-1) and (N-2) networknsecurity conditions. An important feature of the optimizing interiornpoint LP algorithm is that it can detect infeasibility of the SCEDnproblem reliably. This feature is particularly important in SCEDnapplications since line overloading following a contingency oftennresults in an infeasible schedule. The proposed method is demonstratednon the IEEE 24 bus test system and a practical 175 bus network. Ancomparison is carried out with the predictor-corrector interior pointnalgorithm for the SCED problem presented previously (see ibid., vol. 12,nno.2, p.803-10, 1997)