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

Author

Jabr, Rabih A. ; Coonick, Alun H. ; Cory, Brian J.

Author_Institution

Dept. of Electr. & Electron. Eng., Imperial Coll. of Sci., Technol. & Med., London, UK

Volume

15

Issue

3

fYear

2000

fDate

8/1/2000 12:00:00 AM

Firstpage

930

Lastpage

936

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)

Keywords

linear programming; load dispatching; power system economics; power system security; (N-1) network security conditions; (N-2) network security conditions; 175 bus network; IEEE 24 bus test system; homogeneous linear programming algorithm; interior point algorithm; line overloading; predictor-corrector interior point algorithm; security constrained economic dispatch problem; self-dual linear programming algorithm; Economic forecasting; Frequency; Linear programming; Load flow; Power generation economics; Power system security; Prediction algorithms; Propagation losses; System testing; Voltage;

fLanguage

English

Journal_Title

Power Systems, IEEE Transactions on

Publisher

ieee

ISSN

0885-8950

Type

jour

DOI

10.1109/59.871715

Filename

871715