Abstract

The feasible region plays an important role in optimal power flow (OPF) problems. However, constructing the feasible region of general optimal power flow problems is a challenging task. In this paper, a trajectory-unified (TJU) method is developed to compute the feasible region of general large-scale OPF problems. This is the first attempt, to our knowledge, to develop a numerical method to compute feasible regions of OPF problems. In addition, the projection of the computed feasible region into a desired low-dimensional sub-space is presented. By employing the proposed TJU method, we compute the feasible region of a 9-bus and the IEEE 118-bus OPF problem. It is shown that the feasible region of a power system grows in size from light-loading conditions to medium-loading conditions while it shrinks in size from medium-loading conditions to heavy-loading conditions. This discovery of a geometric property of the feasible solution asserts the observations that OPF problems are generally easy to solve during medium-loading conditions but are generally difficult to solve during heavy-loading conditions.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call