整数规划
序列(生物学)
线性规划
数学优化
计算机科学
整数(计算机科学)
区间(图论)
分支机构和价格
稳健优化
数学
遗传学
组合数学
生物
程序设计语言
作者
Luis Baringo,Antonio J. Conejo
标识
DOI:10.1109/tpwrs.2010.2092793
摘要
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.
科研通智能强力驱动
Strongly Powered by AbleSci AI