动态规划与静态规划的关系.docxVIP

动态规划与静态规划的关系动态规划与静态规划(线性和非线性规划等)研究的对象本质上都是在若干约束条件下的函数极值问题。两种规划在很多情况下原则上可以相互转换。动态规划可以看作求决策u1,u2,...,un?，使指标函数V1n(xl,u1,u2,...,un)达到最优(最大或最小)的极值问题，状态转移方程、端点条件以及允许状态集、允许决策集等是约束条件，原则上可以用非线性规划方法求解。一些静态规划只要适当引入阶段变量、状态、决策等就可以用动态规划方法求解。下面用例子说明：[例11]?用动态规划解下列非线性规划:其中gk(uk)为任意的已知函数。解：按变量uk的序号k划分阶段，看作n段决策过程；设状态为x1,x2,..xn，取问题中的变量u1,u2,..,un为决策；状态转移方程为：取gk(uk)为阶段指标，最优值函数的基本方程为(注意到xn+1=0)：解此动态规划即可得到原静态规划的解。上面这个静态规划的模型有很多实际应用，比如下面这个问题：[例12] InflateThe more points students score in our contests, the happier we here at the USACO are. We try to design our contests so that people can score as many points as possible, and would like your assistance.We have several categories from which problems can be chosen, where a category is an unlimited set of contest problems which all require the same amount of time to solve and deserve the same number of points for a correct solution. Your task is write a program which tells the USACO staff how many problems from each category to include in a contest so as to maximize the total number of points in the chosen problems while keeping the total solution time within the length of the contest.The input includes the length of the contest, M (1 = M = 10,000) (dont worry, you wont have to compete in the longer contests until training camp) and N, the number of problem categories, where 1 = N = 10,000.Each of the subsequent N lines contains two integers describing a category: the first integer tells the number of points a problem from that category is worth (1 = points = 10000); the second tells the number of minutes a problem from that category takes to solve (1 = minutes = 10000).Your program should determine the number of problems we should take from each category to make the highest-scoring contest solvable within the length of the contest. Remember, the number from any category can be any nonnegative integer (0, one, or many). Calculate the maximum number of possible points.PROGRAM NAME: inflateINPUT FORMATLine 1: M, N -- contest minutes and number