.png){kind=icon}
返回
Offering Strategy Via Robust Optimization
.png){kind=icon}
PRE
AI
DOI：10.1109/TPWRS.2010.2092793.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper provides a technique to build hourly offering curves for a price-taker producer participating in a pool. The technique relies on solving a sequence of robust mixed-integer linear programming problems. Instead of using price predictions as input data, price confidence intervals are considered. These intervals are successively divided into a sequence of nested subintervals, which allow formulating a collection of meaningful and easy-to-solve robust mixed-integer linear programming problems. The solutions of these problems provide adequate information to build hourly offering curves.
Keyword:
Mixed-integer linear programming
optimal offering
pool
price-taker producer
robust optimization
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.2
论文数:
1.1W
被引数:
5.0W
机构
引用论文
.png){kind=icon}
分享收藏
查看更多内容