动态规划方法的应用研究  

Application of dynamic programming method

作　　者：赵娟[1] 樊超[2] 

机构地区：[1]西安工业大学北方信息工程学院,陕西西安710025 [2]陕西青年职业学院

出　　处：《计算机时代》2014年第2期28-30,共3页Computer Era

基　　金：西安工业大学北方信息工程学院院长科研基金(YZ1329)

摘　　要：动态规划是运筹学的一个分支,是求解决策过程最优化的数学方法,其最终目的是确定各决策变量的取值,以使目标函数达到极大或极小。动态规划在工程技术、经济管理等社会各个领域有着广泛的应用,并且获得了显著的效果,是经济管理中一种重要的决策技术。文章例举了动态规划在最短路线、资源分配、设备更新、排序、装载等方面的应用。通过求解不同的实例,总结出用动态规划方法比用其他方法求解更容易、效率更高,并且所得到的解信息更丰富。Dynamic programming is a branch of operation research, which is a mathematical optimization method for decision-making processes. The ultimate goal is to determine the value of each decision such that an objective function reaches a maximum or a minimum. Dynamic programming has a wide range of applications in engineering, economics, management, and other fields, and is an important decision-making technology in economic management. Dynamic programming is illustrated by the examples： the shortest possible route, resource allocation, equipment upgrades, sorting, loading and other applications. The methods in dynamic programming are summarized. Compared with other methods, dynamic programing is easier, more efficient, and can obtain richer information about solutions.

关 键 词：动态规划 最短路线 资源分配 设备更新 

分 类 号：N032[自然科学总论—科学技术哲学]