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

Rajeev Kumar Gajbhiye*, Anindya De, S. A. Soman

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

23 Scopus citations


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.

Original languageEnglish (US)
Pages (from-to)2087-2098
Number of pages12
JournalIEEE Transactions on Power Delivery
Issue number4
StatePublished - Oct 2007


  • Greedy algorithms
  • Integer linear programming
  • Linear programming
  • Minimum break point set (MBPS)
  • NP-complete problem
  • Relays

ASJC Scopus subject areas

  • Energy Engineering and Power Technology
  • Electrical and Electronic Engineering


Dive into the research topics of 'Computation of optimal break point set of relays - An integer linear programming approach'. Together they form a unique fingerprint.

Cite this