用动态规划解决一类最值问题

Solving an Extreme Value With Dynamic Programming

决策论中有一类人力资源分配问题,解决这类问题通用的方法是线性规划法。经过研究发现,这类问题具有阶段性、顺序性和可分离性。对该问题进行转化,给出了解决这类问题的动态规划算法。这类方法动态地揭示了决策者在优化人力资源方面的全过程,弥补了线性规划在处理这类问题中的不足(不能细化决策的全过程)。

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.