论文部分内容阅读
本刊1985年第二期刊登了许自达同志的《对“应用动态规划选择梯级水电站的最优死水位”的一些看法》一文(下称许文),实质是围绕顺序递推中一些概念问题,特别是状态方程逆转的问题而提出的。现一一答复如下,不妥之处尚请指正。状态转移方程是动态规划数学模型的重要组成部分之一,它将状态变量、决策变量和递推(或决策)方向有机地组合在一起,用函数的形式表达出来。逆序递推时通式为S_(i+1)=T_i(S_i,D_i)对顺序递推,如果阶段序号i和状态变量S_i的定义不变,而决策变量D_i定义为D_i=S_i,则顺序递推时状态转移方程通式为
The second issue of 1985 issue of Comrade Xu Zeda’s “on the application of dynamic programming to select the optimal dead water level cascade hydropower station” some of the views "article (hereinafter referred to as Xu Wen), in essence, recursive order around some of the conceptual issues, in particular It is proposed that the state equation is reversed. The answer to the one below is as follows, please correct me wrong. The state transition equation is one of the most important parts of the mathematical model of dynamic programming. It combines the state variables, decision variables and recursion (or decision) direction organically and expresses it as a function. If the definition of stage number i and state variable S_i is unchanged and the decision variable D_i is defined as D_i = S_i, then the order of recursion in reverse order recursion is S_ (i + 1) = T_i (S_i, D_i) Recursion state transition equations for the general formula