论文部分内容阅读
一、问题的提出给定n台机组,各机组燃料费特性曲线已知为 f_i(p_i)=a_ip_i~2+b_ip_i+c_i (i=1,2,…,n)其中a_i,b_i,c_i均为正的常数。各机组上、下限出力为Pimin,Pimax。(i=1,2,…,n)。给定负载荷P_R在n台机组间进行经济负荷分配,可表述为如下数学规划问题: 目标函数:F(p_R)=sum from i=1 to n(a_ip_i~2+b_ip_i+c_i)→min (1—1) 满足约束条件:sum from i=1 to m P_i=P_r (1—2) P_(imin)≤P_i≤P_(imax) (1—3) 以上规划问题简称规划A,目前常用的求解该规划的等微增率法,简称算法Ⅰ。其计算框图见文献[2]。
First, the question is given Given n units, the unit fuel costs curve is known as f_i (p_i) = a_ip_i ~ 2 + b_ip_i + c_i (i = 1,2, ..., n) where a_i, b_i, c_i are Positive constant. Each unit, the lower limit of output to Pimin, Pimax. (i = 1, 2, ..., n). Given a load P_R among n units economic load distribution can be expressed as the following mathematical programming problem: The objective function: F (p_R) = sum from i = 1 to n (a_ip_i ~ 2 + b_ip_i + c_i) → min ( 1-1) Satisfy the constraint: sum from i = 1 to m P_i = P_r (1-2) P_ (imin) ≤P_i≤P_ (imax) (1-3) The above planning problems referred to as planning A, the commonly used solution The micro-increase rate of the planning method, referred to as algorithm Ⅰ. The calculation block diagram in the literature [2].