A New Mixed Integer Linear Programming Formulation for Protection Relay Coordination Using Disjunctive Inequalities

Abstract

Numerical optimization-based solution to directional overcurrent relay (DOCR) coordination problem has been a widely addressed research problem in the recent past. Many linear (LP), nonlinear (NLP), mixed integer nonlinear (MINLP), mixed integer linear (MILP), and quadratically constrained quadratic programming (QCQP)-based formulations have been presented in the past literature. This paper proposes a new MILP-based formulation using disjunctive inequalities. The nonlinear DOCR protection coordination model is formulated as MILP by linearizing the bilinear terms existing in the original formulation. One of the variables in each bilinear term is discretized over its interval into a fixed number of steps. After assigning binary variables to each discrete interval, the resulting bilinear terms with binary variables are written in terms of disjunctive inequalities. The results have shown that the proposed MILP formulation fetch better optimal solutions compared with past MILP and MINLP formulations. The MILP problem is programmed in GAMS package with CPLEX solver and tested on standard 3 bus, 9 bus, 15 bus, and 30 bus systems and results are found to be satisfactory.