动态规划多阶段决策过程最优化推广  

Dynamic Programming Promotion of the Combinatorial Optimization Problem

作　　者：温大伟[1] 谢文环 WEN Da-wei;XIE Wen-huan(School of Mathematics,Lanzhou City University,Lanzhou Gansu 730070;Apartment Management Center,Lanzhou Polytechnic College,Lanzhou Gansu 730050)

机构地区：[1]兰州城市学院数学学院,甘肃兰州730070 [2]兰州工业学院公寓管理中心,甘肃兰州730050

出　　处：《甘肃高师学报》2018年第2期7-9,共3页Journal of Gansu Normal Colleges

摘　　要：动态规划是求解多阶段决策过程的一种数学方法,把多阶段决策过程一分为二,综合应用顺序解法和逆序解法去求解效果会更好,并具有一定可行性.Dynamic programming is a mathematical method to solve the combinatorial optimization problem,and split the combinatorial optimization problem in two,the combination of sequential solution and reverse solution is better,and it’s feasible.

关 键 词：动态规划 最优化原理 最短路径问题 

分 类 号：O221.4[理学—运筹学与控制论]