线性规划问题 已知 0<=X1<=15 0<=x1+x2<=20 0<=x1+x2+x3<=23 0<=x1+x2+x3+x4<=25
已知0<=X1<=150<=x1+x2<=200<=x1+x2+x3<=230<=x1+x2+x3+x4<=250<=X1+x2+x3+x4+x5<=320<=x1+x2...
已知 0<=X1<=15
0<=x1+x2<=20
0<=x1+x2+x3<=23
0<=x1+x2+x3+x4<=25
0<=X1+x2+x3+x4+x5<=32
0<=x1+x2+x3+x4+x5+x6<=36
求:Y=11x1+18x2+13x3+17x4+20x5+10x6 的最小值
急!!!!!!!
其中X1 X2 X3 X4 X5 X6 均为自然数(0也包括在内)! 展开
0<=x1+x2<=20
0<=x1+x2+x3<=23
0<=x1+x2+x3+x4<=25
0<=X1+x2+x3+x4+x5<=32
0<=x1+x2+x3+x4+x5+x6<=36
求:Y=11x1+18x2+13x3+17x4+20x5+10x6 的最小值
急!!!!!!!
其中X1 X2 X3 X4 X5 X6 均为自然数(0也包括在内)! 展开
展开全部
model:
min=11*x1+18*x2+13*x3+17*x4+20*x5+10*x6;
x1>0;
x1<15;
x1+x2>0;
x1+x2<20;
x1+x2+x3>0;
x1+x2+x3<23;
x1+x2+x3+x4>0;
x1+x2+x3+x4<25;
x1+x2+x3+x4+x5>0;
x1+x2+x3+x4+x5<32;
x1+x2+x3+x4+x5+x6>0;
x1+x2+x3+x4+x5+x6<36;
@free(x2);
@free(x3);
@free(x4);
@free(x5);
@free(x6);
end
最优解为:
Global optimal solution found.
Objective value: -272.0000
Total solver iterations: 0
Variable Value Reduced Cost
X1 15.00000 0.000000
X2 -15.00000 0.000000
X3 23.00000 0.000000
X4 2.000000 0.000000
X5 -25.00000 0.000000
X6 0.000000 0.000000
即最优解为:(x1,x2,x3,x4,x5,x6)=(15,-15,23,2,-25,0) 最小值(最优值)为:-272
min=11*x1+18*x2+13*x3+17*x4+20*x5+10*x6;
x1>0;
x1<15;
x1+x2>0;
x1+x2<20;
x1+x2+x3>0;
x1+x2+x3<23;
x1+x2+x3+x4>0;
x1+x2+x3+x4<25;
x1+x2+x3+x4+x5>0;
x1+x2+x3+x4+x5<32;
x1+x2+x3+x4+x5+x6>0;
x1+x2+x3+x4+x5+x6<36;
@free(x2);
@free(x3);
@free(x4);
@free(x5);
@free(x6);
end
最优解为:
Global optimal solution found.
Objective value: -272.0000
Total solver iterations: 0
Variable Value Reduced Cost
X1 15.00000 0.000000
X2 -15.00000 0.000000
X3 23.00000 0.000000
X4 2.000000 0.000000
X5 -25.00000 0.000000
X6 0.000000 0.000000
即最优解为:(x1,x2,x3,x4,x5,x6)=(15,-15,23,2,-25,0) 最小值(最优值)为:-272
更多追问追答
追问
其中X1 X2 X3 X4 X5 X6 均为自然数(0也包括在内)!麻烦下你了!!
追答
这样的话,你的式子的答案就很容易看出来了,全等于零的时候是最小的。。
推荐律师服务:
若未解决您的问题,请您详细描述您的问题,通过百度律临进行免费专业咨询
广告 您可能关注的内容 |