数学建模

量xij,若选队员i参加泳姿j的比赛,记xij=1,否则记xij=0。每人最多只能选四种泳姿的一个;每种泳姿必须有一人且只能有一个人参加。软件实现用Lingo软件,设计的模型求解代码如下:model:sets:person/1..5/;position/1..4/;link(person,position):c,x;endsetsdata:c=66.8,75.6,87,58.6,57.2,66,66.4,53,78,67.8,84.6,59.4,70,74.2,69.6,57.2,67.4,71,83.8,62.4;enddatamin=@sum(link:c*x);@for(person(i):@sum(position(j):x(i,j))<=1;);@for(position(i):@sum(person(j):x(j,i))=1;);@for(link:@bin(x));end结果分析用Lingo软件可得到下列结果:Globaloptimalsolutionfound.Objectivevalue:253.2000Extendedsolversteps:0Totalsolveriterations:0VariableValueReducedCostC(1,1)66.800000.000000C(1,2)75.600000.000000C(1,3)87.000000.000000C(1,4)58.600000.000000C(2,1)57.200000.000000C(2,2)66.000000.000000C(2,3)66.400000.000000C(2,4)53.000000.000000C(3,1)78.000000.000000C(3,2)67.800000.000000C(3,3)84.600000.000000C(3,4)59.400000.000000