| 用动态规划解决一类最值问题 |
| |
| 引用本文： | 王江荣.用动态规划解决一类最值问题[J].兰州石化职业技术学院学报,2009,9(3):67-68. |
| |
| 作者姓名： | 王江荣 |
| |
| 作者单位： | 兰州石化职业技术学院,信息处理与控制工程系,甘肃,兰州,730060 |
| |
| 摘 要： | 决策论中有一类人力资源分配问题,解决这类问题通用的方法是线性规划法.经过研究发现,这类问题具有阶段性、顺序性和可分离性.对该问题进行转化,给出了解决这类问题的动态规划算法.这类方法动态地揭示了决策者在优化人力资源方面的全过程,弥补了线性规划在处理这类问题中的不足(不能细化决策的全过程).
|
| 关 键 词： | 资源分配 动态规划 最优值 |
Solving an Extreme Value With Dynamic Programming |
| |
| WANG Jiang-rong.Solving an Extreme Value With Dynamic Programming[J].Journal of Lanzhou Petrochemical Vocational College of Technology,2009,9(3):67-68. |
| |
| Authors: | WANG Jiang-rong |
| |
| Institution: | Lanzhou Petrochemical College of Vocational Technology;Lanzhou 730060;China |
| |
| Abstract: | There is a kind of human resource allocation problem in Decision Theory,and a common approach to solve such problems is linear programming method.After the study it is found that such problems have a phase,sequence and separability.This paper aims to solve such problems with dynamic programming algorithm.These methods reveal the dynamic decision-makers in optimizing human resources as a whole.It also makes up linear programming problems in dealing with such deficiencies. |
| |
| Keywords: | resource allocation dynamic programming optimal value |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
