.png){kind=icon}
返回
Security-constrained optimal generation scheduling for GENCOs
.png){kind=icon}
PRE
AI
DOI：10.1109/TPWRS.2004.831301.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper presents an approach for maximizing a GENCO's profit in a constrained power market. The proposed approach considers the Interior Point Method (IPM) and Benders decomposition for solving the security-constrained optimal generation scheduling (SC-GS) problem. The master problem represents the economic dispatch problem for a GENCO which intends to optimize its profit. The formulation of the master problem does not bear any transmission network constraints. The subproblem will be used by the same GENCO to check the viability of its proposed bidding strategy in the presence of transmission network constraints. In this case if the subproblem does not yield a certain level of financial return for the GENCO or if the subproblem results in an infeasible solution of the GENCO's proposed bidding strategy, the GENCO will modify its proposed solution according to the Benders cuts that stem out of the subproblem. The study shows a more flexible scheduling paradigm for a GENCO in a competitive arena. The proposed approach proves practical for modeling the impact of transmission congestion on a GENCO's expected profit in a competitive environment.
Keyword:
benders decomposition
contingency
corrective action
interior point method
preventive action
restructuring
SC-GS
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.2
论文数:
1.1W
被引数:
5.0W
机构
暂无机构信息
引用论文
分享收藏分享收藏
Analysis of the quality, reliability, and popularity of information on strabismus on YouTube.png)
Strabismus
StrabismusIF0
PREAI
分享收藏
查看更多内容