文件名称:第04章 动态规划
介绍说明－－下载内容均来自于网络，请自行研究使用
动态规划（dynamic programming）是运筹学的一个分支，是求解决策过程（decision
process）最优化的数学方法。 20 世纪 50 年代初 R. E. Bellman 等人在研究多阶段决策过
程(multistep decision process)的优化问题时，提出了著名的最优性原理（principle of
optimality），把多阶段过程转化为一系列单阶段问题，逐个求解，创立了解决这类过程
优化问题的新方法—动态规划。(Dynamic programming (dynamic programming) is a branch of operational research, is to solve the decision-making process (decision
Process) mathematical optimization methods. At the beginning of the 1950s R. E. Bellman et al in the research on multi stage decision
Cheng (multistep decision process) optimization problem, put forward the principle of optimality of the famous principle (of
Optimality), the multi stage process into a series of single stage, one by one solution, created to solve this kind of process
A new method of dynamic programming optimization problems.)
process）最优化的数学方法。 20 世纪 50 年代初 R. E. Bellman 等人在研究多阶段决策过
程(multistep decision process)的优化问题时，提出了著名的最优性原理（principle of
optimality），把多阶段过程转化为一系列单阶段问题，逐个求解，创立了解决这类过程
优化问题的新方法—动态规划。(Dynamic programming (dynamic programming) is a branch of operational research, is to solve the decision-making process (decision
Process) mathematical optimization methods. At the beginning of the 1950s R. E. Bellman et al in the research on multi stage decision
Cheng (multistep decision process) optimization problem, put forward the principle of optimality of the famous principle (of
Optimality), the multi stage process into a series of single stage, one by one solution, created to solve this kind of process
A new method of dynamic programming optimization problems.)
相关搜索： 动态规划
(系统自动生成,下载前可以参看下载内容)
下载文件列表
| 文件名 | 大小 | 更新时间 |
|---|---|---|
| 第04章 动态规划.pdf | 209456 | 2013-06-17 |