发电竞价算法(五)——线性规划法

摘要

The linear programming model for solving generation bidding problem is described, and the computing procedure is then illustrated by means of a two-unit case as an example. Emphasis is moving upon dealing with network security constraints, declining characteristics of bidding curves and transmission losses. It seems that the method applicable to the generation bidding problem can conveniently deal with a variety of constraints and is of practical at present.%介绍了发电竞价问题的线性规划模型，并用2机组为例说明了计算过程。着重对网络安全约束、下降报价特性及网损的处理进行了研究。线性规划适用于发电竞价问题，可以比较方便地处理各种约束问题，是目前较为实用的算法。