A New Approach to Reduce Constraints of the Optimal Coordination

The optimal programming coordination is known as the efficient method to set the overcurrent relays time and current settings. However, the large number of constraints may limit the benefits of the optimal programming. In this paper, an effective method is presented to reduce the number of constraints and remove those make the optimal problem be infeasible. Therefore, the feasibility of the optimal problem is increased and the run-time of the program is decreased. The new method is supported by obtained results of a typical 8-Bus and a real network.

Keywords:

Optimal Coordination , Constraint Reduction , Overcurrent Relay