1986
DOI: 10.1016/0378-7796(86)90048-9
|View full text |Cite
|
Sign up to set email alerts
|

An optimal load flow study by the generalized reduced gradient approach

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
13
0

Year Published

2012
2012
2023
2023

Publication Types

Select...
8

Relationship

0
8

Authors

Journals

citations
Cited by 47 publications
(13 citation statements)
references
References 1 publication
0
13
0
Order By: Relevance
“…More details about GRG technique can be found elsewhere [46][47][48][49][50]. SLP method which uses linear programming as a search technique, was devised and tested on petroleum refinery optimization [51].…”
Section: Constrained Multivariable Search Methodsmentioning
confidence: 99%
“…More details about GRG technique can be found elsewhere [46][47][48][49][50]. SLP method which uses linear programming as a search technique, was devised and tested on petroleum refinery optimization [51].…”
Section: Constrained Multivariable Search Methodsmentioning
confidence: 99%
“…The standard BA, CBA-III and CBA-IV algorithms are implemented on the IEEE 14-bus test system for the minimization of the active power loss defined in (6) taking into account the penalty terms defined in (20). Table 2 illustrates the best results yielded by the standard BA, CBA-III, CBA-IV and those yielded by other algorithms reported in the literature including DE [52], MTLA-DDE [116], MGBTLBO [58], SARGA [49], etc.…”
Section: ) Case 1: Minimization Of Active Power Lossmentioning
confidence: 99%
“…For the present case, the minimization of the Total Voltage Deviations (TVD) discussed in (7) is considered as the objective function together with the penalty factors defined in (20).…”
Section: ) Case 2: Minimization Of Total Voltage Deviationmentioning
confidence: 99%
See 1 more Smart Citation
“…In the first stage, many traditional numerical methods called deterministic methods such as gradient search (GS) [3], Newton method (NM) [4], interior point method (IPM) [5][6][7], linear program (LP) [8][9][10], dynamic programming method (DPM) [11], quadratic programming method (QPM) [12,13], and Lagrangian method (LM) [14] have found optimal solutions with acceptable quality, but these methods have met many disadvantages such as highly time consuming manner, high number of iterations, huge number of computation processes, incapability of handling nondifferentiable constraints and objective functions, and easily falling into local optimum solution zone. In this regard, the ones should be retired to make room for new algorithms that have better search ability.…”
Section: Complexitymentioning
confidence: 99%