Min-max transfer capability: a new concept

In this paper we discuss a new concept of an interval for transfer capability and present an algorithm for computing its lower bound which we term the min-max transfer capability. The algorithm is a Bisection Search algorithm. We compare it to a branch-and-bound algorithm, which is standard for min-max problems. We find that the Bisection Search algorithm is efficient and simple to implement. We describe the conceptual analysis and the algorithm using a DC load flow setting. A generalization of the algorithm to problems using an AC load flow is briefly discussed. We then demonstrate the new algorithm using the IEEE 118-bus system.