Dual feasible direction-finding nonlinear programming combined with metaheuristic approaches for exact overcurrent relay coordination

2020 ◽  
Vol 114 ◽  
pp. 105420 ◽  
Author(s):  
A. Darabi ◽  
M. Bagheri ◽  
G.B. Gharehpetian
Keyword(s):  
Nonlinear Programming ◽  
Direction Finding ◽  
Feasible Direction ◽  
Relay Coordination ◽  
Overcurrent Relay

A Modification of Feasible Direction Optimization Method for Handling Equality Constraints

1989 ◽  
Vol 111 (3) ◽  
pp. 442-445
Author(s):  
Yong Chen ◽  
Bailin Li
Keyword(s):  
Nonlinear Programming ◽  
Optimization Method ◽  
Direction Finding ◽  
Equality Constraints ◽  
Feasible Region ◽  
Feasible Direction ◽  
Feasible Direction Method ◽  
Traditional Algorithm ◽  
Inequality Type ◽  
Nonlinear Equality

The Feasible Direction Method of Zoutendijk has proven to be one of the most efficient algorithms currently available for solving nonlinear programming problems with only inequality type constraints. Since in the case of equality type constraints, there exists no nonzero direction close to the feasible region, the traditional algorithm cannot work properly. In this paper, a modified feasible direction finding technique has been proposed in order to handle nonlinear equality constraints for the Feasible Direction Method. The algorithm is based on searching along directions intersecting the tangent of the equality constraints at some angle which makes the move toward the interior of the feasible region.

Directional overcurrent relay coordination by means of genetic algorithms of Chu-Beasley

2018 ◽  
Vol 13 (4) ◽  
pp. 522-528 ◽  
Author(s):  
Gina Idarraga-Ospina ◽  
Noe A. Mesa-Quintero ◽  
Jaime A. Valencia ◽  
Alberto Cavazos ◽  
Eduardo Orduna
Keyword(s):  
Genetic Algorithms ◽  
Relay Coordination ◽  
Overcurrent Relay

A Modification of Feasible Direction Optimization Method for Handling Equality Constraints

1988 ◽  
Author(s):  
Yong Chen ◽  
Bailin Li
Keyword(s):  
Nonlinear Programming ◽  
Efficient Algorithm ◽  
Optimization Method ◽  
Equality Constraints ◽  
Feasible Region ◽  
Feasible Direction ◽  
Feasible Direction Method ◽  
Traditional Algorithm ◽  
Inequality Type ◽  
Nonlinear Equality

Abstract The Feasible Direction Method of Zoutendijk has proven to be one of the efficient algorithm currently available for solving nonlinear programming problems with only inequality type constraints. Since in the case of having equality type constraints, there does not exist nonzero direction close to the feasible region, the traditional algorithm can not work properly. In this paper, a modified feasible direction finding technique has been proposed in order to handle nonlinear equality constraints for the Feasible Direction Method. The algorithm is based on searching along directions intersecting the tangent of the equality constraints at some angle which makes the move toward the interior of the feasible region.

Sign in / Sign up

Export Citation Format

Share Document