
求数学建模题答案
某公司有6个供货栈(仓库),库存货物总数分别为60,55,51,43,41,52,现有8个客户各要一批货,数量分别为35,37,22,32,41,32,43,38.各供货...
某公司有6个供货栈(仓库),库存货物总数分别为60,55,51,43,41,52,现有8个客户各要一批货,数量分别为35,37,22,32,41,32,43,38.各供货栈到8个客户处的单位货物运输价如下(元/每单位)。试确定各货栈到各客户处的货物调运数量,使总的运输费用最小。 要求附上LINGO程序。
单位货物运输价(元)
V1 V2 V3 V4 V5 V6 V7 V8
W1 6 2 6 7 4 2 5 9
W2 4 9 5 3 8 5 8 2
W3 5 2 1 9 7 4 3 5
W4 7 6 7 3 9 2 7 1
W5 2 3 9 5 7 2 6 5
W6 5 5 2 2 8 1 4 3 展开
单位货物运输价(元)
V1 V2 V3 V4 V5 V6 V7 V8
W1 6 2 6 7 4 2 5 9
W2 4 9 5 3 8 5 8 2
W3 5 2 1 9 7 4 3 5
W4 7 6 7 3 9 2 7 1
W5 2 3 9 5 7 2 6 5
W6 5 5 2 2 8 1 4 3 展开
1个回答
展开全部
model:
sets:
w/1..6/:a;
v/1..8/:b;
link(w,v):c,x;
endsets
data:
a=60 55 51 43 41 52;
b=35 37 22 32 41 32 43 38;
c=
6 2 6 7 4 2 5 9
4 9 5 3 8 5 8 2
5 2 1 9 7 4 3 5
7 6 7 3 9 2 7 1
2 3 9 5 7 2 6 5
5 5 2 2 8 1 4 3;
@text('d:\x.txt')=x;
enddata
min=@sum(link:x*c);
@for(w(i):@sum(v(j):x(i,j))<=a(i));
@for(v(j):@sum(w(i):x(i,j))=b(j));
end
结果 按照x11 x12 ....x21 x22..这样的矩阵形式排列
x=
0.0000000
19.000000
0.0000000
0.0000000
41.000000
0.0000000
0.0000000
0.0000000
1.0000000
0.0000000
0.0000000
32.000000
0.0000000
0.0000000
0.0000000
0.0000000
0.0000000
11.000000
0.0000000
0.0000000
0.0000000
0.0000000
40.000000
0.0000000
0.0000000
0.0000000
0.0000000
0.0000000
0.0000000
5.0000000
0.0000000
38.000000
34.000000
7.0000000
0.0000000
0.0000000
0.0000000
0.0000000
0.0000000
0.0000000
0.0000000
0.0000000
22.000000
0.0000000
0.0000000
27.000000
3.0000000
0.0000000
sets:
w/1..6/:a;
v/1..8/:b;
link(w,v):c,x;
endsets
data:
a=60 55 51 43 41 52;
b=35 37 22 32 41 32 43 38;
c=
6 2 6 7 4 2 5 9
4 9 5 3 8 5 8 2
5 2 1 9 7 4 3 5
7 6 7 3 9 2 7 1
2 3 9 5 7 2 6 5
5 5 2 2 8 1 4 3;
@text('d:\x.txt')=x;
enddata
min=@sum(link:x*c);
@for(w(i):@sum(v(j):x(i,j))<=a(i));
@for(v(j):@sum(w(i):x(i,j))=b(j));
end
结果 按照x11 x12 ....x21 x22..这样的矩阵形式排列
x=
0.0000000
19.000000
0.0000000
0.0000000
41.000000
0.0000000
0.0000000
0.0000000
1.0000000
0.0000000
0.0000000
32.000000
0.0000000
0.0000000
0.0000000
0.0000000
0.0000000
11.000000
0.0000000
0.0000000
0.0000000
0.0000000
40.000000
0.0000000
0.0000000
0.0000000
0.0000000
0.0000000
0.0000000
5.0000000
0.0000000
38.000000
34.000000
7.0000000
0.0000000
0.0000000
0.0000000
0.0000000
0.0000000
0.0000000
0.0000000
0.0000000
22.000000
0.0000000
0.0000000
27.000000
3.0000000
0.0000000
推荐律师服务:
若未解决您的问题,请您详细描述您的问题,通过百度律临进行免费专业咨询