Computing Critical $k$-tuples in Power Networks

Details Computing Critical $k$-tuples in Power Networks Computing Critical $k$-tuples in Power Networks

2012-01-02

arxiv.org/abs/1201.0469v1

Computer Science

Computational Engineering, Finance, and Science

Scientific paper

In this paper the problem of finding the sparsest (i.e., minimum cardinality) critical $k$-tuple including one arbitrarily specified measurement is considered. The solution to this problem can be used to identify weak points in the measurement set, or aid the placement of new meters. The critical $k$-tuple problem is a combinatorial generalization of the critical measurement calculation problem. Using topological network observability results, this paper proposes an efficient and accurate approximate solution procedure for the considered problem based on solving a minimum-cut (Min-Cut) problem and enumerating all its optimal solutions. It is also shown that the sparsest critical $k$-tuple problem can be formulated as a mixed integer linear programming (MILP) problem. This MILP problem can be solved exactly using available solvers such as CPLEX and Gurobi. A detailed numerical study is presented to evaluate the efficiency and the accuracy of the proposed Min-Cut and MILP calculations.

Affiliated with

Also associated with

No associations

Rating

Computing Critical $k$-tuples in Power Networks does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Computing Critical $k$-tuples in Power Networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Computing Critical $k$-tuples in Power Networks will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-55540