.png){kind=icon}
Return
A homogeneous linear programming algorithm for the security constrained economic dispatch problem
.png){kind=icon}
PRE
AI
DOI：10.1109/59.871715.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper presents a study of the simplified homogeneous and self-dual (SHSD) linear programming (LP) interior point algorithm applied to the security constrained economic dispatch (SCED) problem, Unlike other interior point SCED applications [1]-[3] that consider only the N security problem, this paper considers both (N-1) and (N-2) network security conditions, An important feature of the optimizing interior point LP algorithm is that it can detect infeasibility of the SCED problem reliably, This feature is particularly important in SCED applications since line overloading following a contingency often results in an infeasible schedule, The proposed method is demonstrated on the IEEE 24 bus test system and a practical 175 bus network. A comparison is carried out with the predictor-corrector interior point algorithm for the SCED problem presented in [3].
Keywords:
double outages
homogeneous interior point method
infeasible problem
security constraints
single outages
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
7.2
Papers:
1.1W
Citations:
5.0W
Organization
No organization information available
Cited Papers
ShareSaveShareSaveIsolating the entire posterior left atrium improves surgical outcomes after the Cox maze procedure
OAAI
OAAIShareSaveShareSaveShareSaveAssociative recognition and the hippocampus: Differential effects of hippocampal lesions on object‐place, object‐context and object‐place‐context memory.png)
Hippocampus
HippocampusIF0
PREAI
ShareSaveShareSave
View more