摘要
动态规划是解决多阶段决策过程最优化问题的一种数学方法,资源分配问题解决将一种或几种资源分配给若干用户或投资于几家企业,以获得最大的效益,它可以是多阶段决策过程,也可以是静态规划问题,都能构造动态规划模型求解。本文针对资源分配问题设计了动态规划求解算法,数值结果表明该算法是可行有效的。
One kind of or several kinds oseresources are assigned to some users or invested to several enterprises in order to obtain the biggest benefit. The resource allocating problem may be the muhistep decision process, also may be the static programming problem. All these problems can be solved via dynamic programming. In this paper, it propose dynamic programming algorithm for resource allocating problem. Numerical results show it feasible and effective.
出处
《安庆师范学院学报（自然科学版）》
2008年第2期74-75,共2页
Journal of Anqing Teachers College(Natural Science Edition)
关键词
资源分配问题
动态规划
决策
resource allocating problem
dynamic programming
decision
