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.