Presolve analysis and interior point solutions of the linear programming coordination problem of directional overcurrent relays

Citation
Aj. Urdaneta et al., Presolve analysis and interior point solutions of the linear programming coordination problem of directional overcurrent relays, INT J ELEC, 23(8), 2001, pp. 819-825
Citations number
18
Categorie Soggetti
Eletrical & Eletronics Engineeing
Journal title
INTERNATIONAL JOURNAL OF ELECTRICAL POWER & ENERGY SYSTEMS
ISSN journal
01420615 → ACNP
Volume
23
Issue
8
Year of publication
2001
Pages
819 - 825
Database
ISI
SICI code
0142-0615(200111)23:8<819:PAAIPS>2.0.ZU;2-N
Abstract
A linear programming interior point algorithm is proposed for the solution of the problem of coordinating directional overcurrent relays in interconne cted power systems considering definite time backup relaying. The proposed algorithm is a variation of the primal-dual approach that uses multiple cor rectors of centrality. Pre-solution problem filtering simplification techni ques are used prior to the application of the linear programming algorithm. Results are presented for the application of the methodology on a realisti c test case, a 115-69 kV power system with 108 buses, 86 lines, 61 transfor mers, and 97 directional overcurrent relays. Optimal solutions are found in an automatic fashion, using the algorithm for the settings of the ground r elays as well as for the phase relays. The application of the pre-solution problem simplification techniques is highly recommended, resulting in a sig nificant reduction of the size and complexity of the linear programming pro blem to be solved. The interior point approach reaches a feasible point in the close vicinity of the final optimal result in only one or two iteration s. This fact represents an advantage for on-line applications. The proposed methodology and in particular the use of the presolve problem simplificati on techniques is shown as a new valuable tool for the setting of directiona l overcurrent relays in interconnected power systems. (C) 2001 Elsevier Sci ence Ltd. All rights reserved.