动态规划求最优解是一个反向递推的求解过程，以实例为依据，用正向递推的方法求解动态规划的最优值，并推出动态规划的基本方程和密尔顿-雅可比方程，是对动态规划求最优解方法的探讨。利用动态规划的正向递推方法，在应用中可以大大减少计算量，扩大了它的应用范围。

Backward recurrent method is usually adopted in seeking optimal solution by dynamic programming. A forward recurrent method to find optimal solution by dynamic programming is presented on the basis of an instance. The fundamental equation of dynamic programming and Millton-Jacobi's equation are also derived. It's an exploratory study on optimal solution of dynamic programming. An amount of work is reduced in calculating by using forward recurrent method, while applied range of the method is expanded.