电力系统自动化2001，Vol.25Issue(6)：19-22,65,5.
发电竞价算法（三）—— 动态规划法
GENERATION BIDDING ALGORITHM TUTORIALS Part Three The Dynamic Programming Method
吴玉生 1周京阳 1王功涛 1于尔铿1
作者信息
- 1. 中国电力科学研究院， 北京 100085
- 折叠
摘要
Abstract
Generally, the dynamic programming method can be used in thegeneration bidding in order to solve unit commitment and power dispatch problems, in which the start-up cost and start-off constraints can be implemented in unit commitment models, while in the power dispatch model the dropping characteristics of bidding curve can be handled. However, the dimensions of state variables are out of outage in solving the unit commitment problem by this method, and thus the focuses tend to put on reducing the number of state variables while reserving the optimal solution as far as possible.关键词
电力市场/发电竞价/动态规划分类
信息技术与安全科学引用本文复制引用
吴玉生,周京阳,王功涛,于尔铿..发电竞价算法（三）—— 动态规划法[J].电力系统自动化,2001,25(6):19-22,65,5.
