1990
DOI: 10.1109/59.65896
|View full text |Cite
|
Sign up to set email alerts
|

Further developments in LP-based optimal power flow

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
184
0
9

Year Published

2000
2000
2019
2019

Publication Types

Select...
5
2

Relationship

0
7

Authors

Journals

citations
Cited by 445 publications
(193 citation statements)
references
References 20 publications
0
184
0
9
Order By: Relevance
“…Several review papers were published [39, 45 -47] . Among the various OPF methods proposed, it has been recognized that the main techniques for solving the OPF problems are the gradient method [40] , linear programming (LP) method [49,50] , successive sparse quadratic programming (QP) method [52] , successive nonsparse QP method [54] , Newton ' s method [55] , and Interior Point Methods [61 -66] . Each method has its own advantages and disadvantages.…”
Section: Development Of Optimization Techniques In Opf Solutionsmentioning
confidence: 99%
“…Several review papers were published [39, 45 -47] . Among the various OPF methods proposed, it has been recognized that the main techniques for solving the OPF problems are the gradient method [40] , linear programming (LP) method [49,50] , successive sparse quadratic programming (QP) method [52] , successive nonsparse QP method [54] , Newton ' s method [55] , and Interior Point Methods [61 -66] . Each method has its own advantages and disadvantages.…”
Section: Development Of Optimization Techniques In Opf Solutionsmentioning
confidence: 99%
“…The algebraic NP problem (22) contains a very large number of constraints. We offer some observations that could lead to practical solutions.…”
Section: B Computational Complexitymentioning
confidence: 99%
“…1. We developed the model algorithm based on the successive linear programming method [22] with two additions: incorporation of stability constraints and a new constraint relaxation technique (the constraint relaxation technique described in [22] is also implemented in our code).…”
Section: A An Algorithmmentioning
confidence: 99%
See 1 more Smart Citation
“…The nonlinear objective function and constraints are linearized to enable an LP solution. The LP method has fast speed and reasonable accuracy, and is thus suitable for large systems [24].…”
Section: Linear Programming (Lp)mentioning
confidence: 99%