【摘要】 为了基于动态规划法设计求约束最优化问题(COPs)最优解的迭代算法,在避免使用"标记函数"和递归算法的前提下提出了两种求解模式,给出了设计求COPs最优解的迭代算法一般方法,并利用两个典型优化问题-最长公共子序列问题和矩阵链乘法问题,阐明了如何利用两种求解模式设计求COPs最优解的简捷迭代算法.更多还原

【Abstract】 In order to design iterative algorithm for solving optimal solutions of optimization problems based on dynamic programming,we analyses two cases for structuring the optimal solution without "marking function" and recursive algorithm,and give a general method to directly design iterative algorithm for every case.According to the method,we give a variety of iterative algorithms for solving optimal solutions of the LCS problem and MCM problem respectively.更多还原