动态规划(dynamic programming)是运筹学的一个分支，是求解决策过程(decision process)最优化的数学方法。20世纪50年代初美国数学家R.E.Bellman等人在研究多阶段决策过程(multistep decision process)的优化问题时，提出了著名的最优化原理(principle of optimality)，把多阶段过程转化为一系列单阶段问题，利用各阶段之间的关系，逐个求解，创立了解决这类过程优化问题的新方法——动态规划。-Dynamic programming (programming dynamic) is a branch of operations research, and it is a mathematical method for solving decision (process). In 1950s, the American mathematician R.E.Bellman, principle process multistep (decision optimality), proposed the optimization problem of the multi stage decision process (of), the multi stage process is transformed into a series of single phase problem, and the relationship between each stage is solved.