Computation of optimal break point set of relays-an integer linear programming approach

We propose an integer linear programming (ILP) formulation for the minimum relay break point set (BPS) computation. Subsequently, in the ILP framework, we propose an alternate maximum-independent relay BPS formulation with the intention of minimizing dependency within the BPS. We show that 1) in practice, the relaxed version of the ILP suffices to obtain an integral vertex and 2) the relaxed version of the ILP can be efficiently solved by the dual-simplex method. The performance of the proposed algorithm is compared and contrasted with existing algorithms. Case studies on various test systems show the efficacy of the proposed approach.