| 发电竞价算法(五)——线性规划法 |
| |
| 引用本文： | 王功涛,于尔铿,周京阳,吴玉生. 发电竞价算法(五)——线性规划法[J]. 电力系统自动化, 2001, 25(8): 20-23,33 |
| |
| 作者姓名： | 王功涛 于尔铿 周京阳 吴玉生 |
| |
| 作者单位： | 中国电力科学研究院!北京100085 |
| |
| 摘 要： | 介绍了发电竞价问题的线性规划模型，并用2机组为例说明了计算过程。着重对网络安全约束、下降报价特性及网损的处理进行了研究。线性规划适用于发电竞价问题，可以比较方便地处理各种约束问题，是目前较为实用的算法。
|
| 关 键 词： | 电力市场 发电竞价算法 线性规划法 目标函数 电网 |
| 收稿时间： | 1900-01-01 |
| 修稿时间： | 1900-01-01 |
GENERATION BIDDING ALGORITHM TUTORIALS Part Five The Linear Programming Method |
| |
| Wang Gongtao,Yu Erkeng,Zhou Jingyang,Wu Yusheng. GENERATION BIDDING ALGORITHM TUTORIALS Part Five The Linear Programming Method[J]. Automation of Electric Power Systems, 2001, 25(8): 20-23,33 |
| |
| Authors: | Wang Gongtao Yu Erkeng Zhou Jingyang Wu Yusheng |
| |
| Abstract: | The linear programming model for solving generation bidding problem is described, and the computing procedure isthen illustrated by means of a two-unit case as an example. Emphasis is moving upon dealing with network securityconstraints, declining characteristics of bidding curves and transmission losses. It seems that the method applicable to thegeneration bidding problem can conveniently deal with a variety of constraints and is of practical at present. |
| |
| Keywords: | electricity market generation bidding linear programming network security constraints |
| 本文献已被 CNKI 维普 等数据库收录！ |
| 点击此处可从《电力系统自动化》浏览原始摘要信息 |
|
点击此处可从《电力系统自动化》下载全文 |
