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

The Multistage Programming Method for the Optimal Lineup Problem

建立女子体操团体赛最佳阵容问题的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.