最佳阵容问题的动态规划解法  

The Multistage Programming Method for the Optimal Lineup Problem

作　　者：唐建国[1] 

机构地区：[1]湖南科技学院数学与计算科学系,湖南永州425100

出　　处：《延边大学学报（自然科学版）》2008年第2期79-85,共7页Journal of Yanbian University（Natural Science Edition）

基　　金：湖南省自然科学基金资助项目(03JJY3014)

摘　　要：建立女子体操团体赛最佳阵容问题的0-1规划模型,探索模型的求解方法.针对该模型的特点,在对其进行一些简单变换后可化为动态规划来求解.利用该方法得到最佳阵容问题的解,并将模型推广到更一般的情形,且提出的动态规划解法仍然适用.A 0-1 programming model for the optimal lineup problem of group competition of woman physical jerks is established, and the method for finding its optimal solutions is explored. According to the characteristic of the model, a multistage programming method is proposed for solving this problem after some simple transformations. We obtain the optimal solutions of the optimal lineup problem by using the proposed method. Finally, the model is generalized into some more general cases, and the multistage programming method is still usefull for the cases.

关 键 词：最佳阵容问题 0—1规划 动态规划 最优解 

分 类 号：O221.3[理学—运筹学与控制论] O221.4[理学—数学]