By Topic

Computation of Optimal Break Point Set of Relays—An Integer Linear Programming Approach

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Gajbhiye, R.K. ; Indian Inst. of Technol., Bombay ; De, A. ; Soman, S.A.

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.

Published in:

Power Delivery, IEEE Transactions on  (Volume:22 ,  Issue: 4 )