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

Abstract A linear programming interior point algorithm is proposed for the solution of the problem of coordinating directional overcurrent relays in interconnected power systems considering definite time backup relaying. The proposed algorithm is a variation of the primal–dual approach that uses multiple correctors of centrality. Pre-solution problem filtering simplification techniques are used prior to the application of the linear programming algorithm. Results are presented for the application of the methodology on a realistic test case, a 115–69 kV power system with 108 buses, 86 lines, 61 transformers, and 97 directional overcurrent relays. Optimal solutions are found in an automatic fashion, using the algorithm for the settings of the ground relays as well as for the phase relays. The application of the pre-solution problem simplification techniques is highly recommended, resulting in a significant reduction of the size and complexity of the linear programming problem 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 iterations. This fact represents an advantage for on-line applications. The proposed methodology and in particular the use of the presolve problem simplification techniques is shown as a new valuable tool for the setting of directional overcurrent relays in interconnected power systems.

[1]  Sanjay Mehrotra,et al.  On the Implementation of a Primal-Dual Interior Point Method , 1992, SIAM J. Optim..

[2]  A. J. Urdaneta,et al.  Coordination of directional overcurrent relay timing using linear programming , 1996 .

[3]  A. J. Urdaneta,et al.  Optimal coordination of directional overcurrent relays considering definite time backup relaying , 1999 .

[4]  Stephen J. Wright.  Primal-Dual Interior-Point Methods , 1997, Other Titles in Applied Mathematics.

[5]  A. J. Urdaneta,et al.  Optimal coordination of directional overcurrent relays in interconnected power systems , 1988 .

[6]  Gautam Mitra,et al.  Analysis of mathematical programming problems prior to applying the simplex algorithm , 1975, Math. Program..

[7]  M. S. Sachdev,et al.  An on-line relay coordination algorithm for adaptive protection using linear programming technique , 1996 .

[8]  Jacek Gondzio,et al.  Presolove Analysis of Linear Programs Prior to Applying an Interior Point Method , 1997, INFORMS J. Comput..

[9]  A. J. Urdaneta,et al.  Optimal coordination of directional overcurrent relays considering dynamic changes in the network topology , 1997 .

[10]  IEEE Report.  Review of Recent Practices and Trends in Protective Relaying , 1981, IEEE Transactions on Power Apparatus and Systems.

[11]  M. Kojima,et al.  A primal-dual interior point algorithm for linear programming , 1988 .

[12]  John E. Beasley.  Advances in Linear and Integer Programming , 1996 .

[13]  N. Megiddo.  Pathways to the optimal set in linear programming , 1989 .

[14]  M. E. Arthur,et al.  Useful Life of Vacuum Interrupters , 1978, IEEE Transactions on Power Apparatus and Systems.

[15]  Roy E. Marsten,et al.  Feature Article - Interior Point Methods for Linear Programming: Computational State of the Art , 1994, INFORMS J. Comput..

[16]  E. Sorrentino,et al.  Comparison of time coordination feasibility criteria for a subtransmission system protection scheme , 1998, Proceedings of the 1998 Second IEEE International Caracas Conference on Devices, Circuits and Systems. ICCDCS 98. On the 70th Anniversary of the MOSFET and 50th of the BJT. (Cat. No.98TH8350).