| 两类动态规划问题的Mathematica求解 |
| |
| 引用本文： | 周康.两类动态规划问题的Mathematica求解[J].武汉工业学院学报,2006,25(1):115-117. |
| |
| 作者姓名： | 周康 |
| |
| 作者单位： | 武汉工业学院,数理科学系,湖北,武汉,430023 |
| |
| 基金项目： | 湖北省高校教学研究项目 |
| |
| 摘 要： | 阐述了动态规划数学建模的基本步骤和动态规划数学模型的基本要素，并分析了求解动态规划数学模型的两类基本算法。通过若干算例，用基于Mathematica软件实现了这两类基本算法。
|
| 关 键 词： | 动态规划 Mathematica软件 算法 |
| 文章编号： | 1009-4881（2006）01-0115-03 |
| 收稿时间： | 2005-09-26 |
| 修稿时间： | 2005年9月26日 |
TO SOLVE TWO KINDS OF DYNAMIC PROGRAMMING PROBLEM ON MATHEMATICA |
| |
| ZHOU Kang.TO SOLVE TWO KINDS OF DYNAMIC PROGRAMMING PROBLEM ON MATHEMATICA[J].Journal of Wuhan Polytechnic University,2006,25(1):115-117. |
| |
| Authors: | ZHOU Kang |
| |
| Affiliation: | Department of Mathematics and Physics, Wuhan Polytechnic University,Wuhan 430023, China |
| |
| Abstract: | Essential steps of making mathematics model with dynamic programming are expatiated in detail as well as essential elements of dynamic programming model. Then, two kinds of basal algorithms to solve dynamic programming model are analyzed. Finally, By several examples, the two kinds of basal algorithms is realized with mathematica software. |
| |
| Keywords: | dynamic programming mathematica software algorithm |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
