1987
DOI: 10.1109/mper.1987.5527556
|View full text |Cite
|
Sign up to set email alerts
|

Network Simplex Method Applied to AC Load-Flow Calculation

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
2
0

Year Published

2009
2009
2021
2021

Publication Types

Select...
2

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(2 citation statements)
references
References 1 publication
0
2
0
Order By: Relevance
“…Power routing through an electric network was presented in [34], with the proposed solution based on successive shortest path and scaling push‐relabel algorithms. A recent review of electric networks and algebraic graph theory models and specific properties was introduced in [35], and a network simplex method application for AC power flow problems was investigated in [36], which has a long execution time, compared with Newton–Raphson based methods.…”
Section: Introductionmentioning
confidence: 99%
“…Power routing through an electric network was presented in [34], with the proposed solution based on successive shortest path and scaling push‐relabel algorithms. A recent review of electric networks and algebraic graph theory models and specific properties was introduced in [35], and a network simplex method application for AC power flow problems was investigated in [36], which has a long execution time, compared with Newton–Raphson based methods.…”
Section: Introductionmentioning
confidence: 99%
“…Problems regarding steady state and transient analysis of power systems mainly require iterative solutions of large sets of equations representing system components [1]. The load flow calculation is one of the most basic problems in power engineering [2][3][4][5][6][7][8]. The repetitive solution of a large set of linear equations in the load flow problem is one of the most time consuming parts of power system simulations.…”
Section: Introductionmentioning
confidence: 99%