2012 9th International Conference on Electrical Engineering/Electronics, Computer, Telecommunications and Information Technolog 2012
DOI: 10.1109/ecticon.2012.6254294
|View full text |Cite
|
Sign up to set email alerts
|

Application of linear programming for optimal coordination of directional over-current relays

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
5
0

Year Published

2015
2015
2018
2018

Publication Types

Select...
4
3

Relationship

0
7

Authors

Journals

citations
Cited by 9 publications
(5 citation statements)
references
References 5 publications
0
5
0
Order By: Relevance
“…The constraint shown in (9) refers to the T relay needed to ensure the selectivity between BP and PP. The constraint shown in (10) prevents that the relay takes a long time to operate, avoiding the equipment damage and the instability of the power system.…”
Section: Constraintsmentioning
confidence: 99%
See 1 more Smart Citation
“…The constraint shown in (9) refers to the T relay needed to ensure the selectivity between BP and PP. The constraint shown in (10) prevents that the relay takes a long time to operate, avoiding the equipment damage and the instability of the power system.…”
Section: Constraintsmentioning
confidence: 99%
“…To solve the OCR coordination problem, classical optimization techniques are used, such as linear programming (LP) [2,3,9] and nonlinear programming (NLP) [10][11][12]. As well as, metaheuristics algorithms (MHAs) have been used.…”
Section: Introductionmentioning
confidence: 99%
“…In [16] the basis for the effective application of linear programming to solve the coordination of directional overcurrent relays problem in large-scale transmission systems, only in terms of the time dial setting, is presented. In [9] the authors present an application example of the linear programming approach to solve the same problem. In [4], the coordination problem with additional constraints, when applied to a ring fed distribution system is presented.…”
Section: Introductionmentioning
confidence: 99%
“…The conventional methods can be characterized as trial and error, topological analysis and optimization methods. Linear programming methodologies [8][9][10], nonlinear programming [11][12][13], mixed integer programing [11], sequential quadratic programming [14], simplex and dual simplex [15,16], and analytical technique [17] require large number of iterations to solve the PC settings. The over-all optimal solution cannot be obtained when the conventional methods are…”
Section: Introductionmentioning
confidence: 99%