Ar+Br=Y+Y2+Y+Y4 (13) 此外的其它约束实际上只是一个简单的变量上界约束 下面直接给出 LINGO程序: model sets num1/1..4/:c1,c2,c3,c4,d1,d2,A,B,X,Y num2/1, 2/: AXY,BXY endsets data c1=94.532.25; c2=15853; d1=1344 d2=1234 max=@sum(num1: cl*x+c2*y-C3*A-C4*B)-2*BXY(1)-1. 5*AXY(2) @sum(numl: A)-@sum(num2: AXY)=0 @sum(numl: B)-@sum(num2: BXY)=0 AXY(1)+BXY(1)-@sum(num1: X)=0 AXY(2)+BXY(2)-@sum (numl: Y @for(numl: @bnd (0, A, 2)i @bnd(0, x, 2)i@bnd(0, B, d1); @bnd(o,Y, d2)) 求解这个模型,得到如下解答: Global optimal solution found at iteration: 44.00000 Variable Reduced cost 9.000000 8.000000 0.000000 C3(1 1.000000 2.000000 0.000000 C3(3) 3.000000 0.00000-353- AY + BY = Y1 + Y2 + Y3 + Y4 （13） 此外的其它约束实际上只是一个简单的变量上界约束。 下面直接给出 LINGO 程序： model: sets: num1/1..4/:c1,c2,c3,c4,d1,d2,A,B,X,Y; num2/1,2/:AXY,BXY; endsets data: c1=9 4.5 3 2.25; c2=15 8 5 3; c3=1 2 3 4; c4=2 4 6 8; d1=1 3 4 4; d2=1 2 3 4; enddata max=@sum(num1:c1*x+c2*y-c3*A-c4*B)-2*BXY(1)-1.5*AXY(2); @sum(num1:A)-@sum(num2:AXY)=0; @sum(num1:B)-@sum(num2:BXY)=0; AXY(1)+BXY(1)-@sum(num1:X)=0; AXY(2)+BXY(2)-@sum(num1:Y)=0; @for(num1:@bnd(0,A,2);@bnd(0,X,2);@bnd(0,B,d1);@bnd(0,Y,d2)); end 求解这个模型，得到如下解答： Global optimal solution found at iteration: 0 Objective value: 44.00000 Variable Value Reduced Cost C1( 1) 9.000000 0.000000 C1( 2) 4.500000 0.000000 C1( 3) 3.000000 0.000000 C1( 4) 2.250000 0.000000 C2( 1) 15.00000 0.000000 C2( 2) 8.000000 0.000000 C2( 3) 5.000000 0.000000 C2( 4) 3.000000 0.000000 C3( 1) 1.000000 0.000000 C3( 2) 2.000000 0.000000 C3( 3) 3.000000 0.000000