.png){kind=icon}
返回
Auction implementation problems using LaGrangian Relaxation
.png){kind=icon}
PRE
AI
DOI：10.1109/59.744488.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
LaGrangian Relaxation (LR) is used as an auction method for bidding in a deregulated environment. This paper focuses on the problems that occur while using LR as an auction method. Identical or similar units can prevent LR horn finding the optimal solution. If the units are similar, LR may have trouble selecting some of them for the optimal solution. A feasible solution may thus not be found. Since a heuristic selection of which unit data to alter has to be applied, this is inequitable to the unit(s)not selected and may result in lawsuit(s). Because the dispatcher has to use heuristic selection, there is no fair'' solution to these problems. The authors suggest previously published methods to implement auctions. Sensitivity analysis has also been applied in this paper to show the percentage difference of similarity between units may affect the solution found.
Keyword:
LaGrangian Relaxation
auction method
unit commitment
sensitivity analysis
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.2
论文数:
1.1W
被引数:
5.0W
机构
暂无机构信息
引用论文
.png){kind=icon}
分享收藏 没有更多内容
没有更多内容