动态规划法及其在矩阵链乘问题上的应用研究

Research of Dynamic Programming Technique and Its Application on the Problem of Matrix Chain-Multiplication

动态规划法是求解最优化问题的一种方法,本文主要研究其求解问题的基本思想及具体步骤,详细分析其用于矩阵链乘问题上的算法设计,并给出其算法实现.

Dynamic programming technique is a sort of method of solving optimization problem. In this article, the basic idea and material process of the method is studied, at the same time ,the algorithms of applying to the matrix chain -multiplication is labored, and the algorithms actualization is presented.