物资紧急调运问题(完稿1)(6)

2025-07-22

X( 2, 5) 0.000000 303.6000 X( 2, 6) 110.0000 141.6000 X( 2, 7) 0.000000 331.2000 X( 3, 1) 0.000000 268.8000 X( 3, 2) 0.000000 398.4000 X( 3, 3) 100.0000 90.00000 X( 3, 4) 0.000000 404.4000 X( 3, 5) 170.0000 174.0000 X( 3, 6) 0.000000 196.8000 X( 3, 7) 100.0000 111.6000 X( 4, 1) 0.000000 356.4000 X( 4, 2) 0.000000 486.0000 X( 4, 3) 0.000000 177.6000 X( 4, 4) 0.000000 492.0000 X( 4, 5) 0.000000 321.6000 X( 4, 6) 0.000000 284.4000 X( 4, 7) 0.000000 199.2000

Row Slack or Surplus Dual Price OBJ 154416.0 -1.000000 2 0.000000 0.000000 3 0.000000 0.000000 4 0.000000 0.000000 5 0.000000 0.000000 6 0.000000 0.000000 7 0.000000 0.000000 8 0.000000 0.000000 9 99550.00 0.000000 10 99590.00 0.000000 11 99630.00 0.000000 12 150.0000 0.000000 13 0.000000 0.000000 14 330.0000 0.000000 15 0.000000 0.000000 16 120.0000 0.000000 17 0.000000 0.000000 18 0.000000 0.000000 19 0.000000 0.000000 20 300.0000 0.000000 21 0.000000 0.000000 22 0.000000 0.000000 23 0.000000 0.000000 24 0.000000 0.000000 25 110.0000 0.000000

26

26 0.000000 0.000000 27 0.000000 0.000000 28 0.000000 0.000000 29 100.0000 0.000000 30 0.000000 0.000000 31 170.0000 0.000000 32 0.000000 0.000000 33 100.0000 0.000000 34 0.000000 0.000000 35 0.000000 0.000000 36 0.000000 0.000000 37 0.000000 0.000000 38 0.000000 0.000000 39 0.000000 0.000000 40 0.000000 0.000000

附录3:

问题二中求第一阶段所需最少时间及调运方案的代码及结果: min=t;

t/6*x1>=500; t/6.08*x2>=700; t/5.68*x3>=500; x1+x2+x3=18;

@floor(t/24)*40+360>=500; @floor(t/24)*20+500>=700; @gin(x1);@gin(x2);@gin(x3);

Objective value: 600.0000 Objective bound: 600.0000 Infeasibilities: 0.1000000E-05 Extended solver steps: 9 Total solver iterations: 200

Variable Value Reduced Cost T 600.0000 0.000000 X1 5.000000 -120.0000 X2 8.000000 0.000000 X3 5.000000 0.000000

Row Slack or Surplus Dual Price 1 600.0000 -1.000000 2 0.000000 -1.200000

27

3 89.47368 0.000000 4 28.16901 0.000000 5 0.000000 0.000000 6 820.0000 0.000000 7 280.0000 0.000000

问题二中求第二阶段所需最少时间及调运方案的代码及结果: min=t;

t/6.47*x1>=330; t/7.2*x2>=120; t/4.32*x3>=300; t/6.72*x4>=110; t/5*x5>=100; t/18.4*x6>=170; t/5.72*x7>=100;

x1+x2+x3+x4+x5+x6+x7=18;

@gin(x1);@gin(x2);@gin(x3);@gin(x4);@gin(x5);@gin(x6);@gin(x7);

Local optimal solution found.

Objective value: 625.6000 Objective bound: 625.6000 Infeasibilities: 0.000000 Extended solver steps: 9 Total solver iterations: 409

Variable Value T 625.6000 X1 4.000000 X2 2.000000 X3 3.000000 X4 2.000000 X5 1.000000 X6 5.000000 X7 1.000000

Row Slack or Surplus 1 625.6000 2 56.76971 3 53.77778 4 134.4444 5 76.19048 6 25.12000

28

7 0.000000 8 9.370629 9 0.000000

附录4:

问题三中求所需运输成本最少的代码及结果: MODEL: sets:

num_i/1..3/; num_j/1..10/:f;

link(num_i,num_j):cost,x; endsets

[OBJ]min=@sum(link(i,j):cost(i,j)*x(i,j)); @for(num_j(j):@sum(link(i,j):x(i,j))=f(j)); @for(link(i,j):x(i,j)>=0); @for(link(i,j):@gin(x(i,j));); data:

cost=120,321.6,184.8,150,408,230.4,156,344.4,256.8,372, 157.6,177.6,69.6,188.4,367.2,189.6,247.2,303.6,141.6,331.2, 200.4,146.4,268.8,398.4,147.6,90,404.4,174,196.8,111.6; f=2000,1200,600,630,150,200,170,220,210,300; enddata

Global optimal solution found.

Objective value: 720096.0 Objective bound: 720096.0 Infeasibilities: 0.000000 Extended solver steps: 0 Total solver iterations: 0

Variable Value Reduced Cost F( 1) 2000.000 0.000000 F( 2) 1200.000 0.000000 F( 3) 600.0000 0.000000 F( 4) 630.0000 0.000000 F( 5) 150.0000 0.000000 F( 6) 200.0000 0.000000 F( 7) 170.0000 0.000000 F( 8) 220.0000 0.000000 F( 9) 210.0000 0.000000 F( 10) 300.0000 0.000000 COST( 1, 1) 120.0000 0.000000

29

COST( 1, 2) 321.6000 0.000000 COST( 1, 3) 184.8000 0.000000 COST( 1, 4) 150.0000 0.000000 COST( 1, 5) 408.0000 0.000000 COST( 1, 6) 230.4000 0.000000 COST( 1, 7) 156.0000 0.000000 COST( 1, 8) 344.4000 0.000000 COST( 1, 9) 256.8000 0.000000 COST( 1, 10) 372.0000 0.000000 COST( 2, 1) 157.6000 0.000000 COST( 2, 2) 177.6000 0.000000 COST( 2, 3) 69.60000 0.000000 COST( 2, 4) 188.4000 0.000000 COST( 2, 5) 367.2000 0.000000 COST( 2, 6) 189.6000 0.000000 COST( 2, 7) 247.2000 0.000000 COST( 2, 8) 303.6000 0.000000 COST( 2, 9) 141.6000 0.000000 COST( 2, 10) 331.2000 0.000000 COST( 3, 1) 200.4000 0.000000 COST( 3, 2) 146.4000 0.000000 COST( 3, 3) 268.8000 0.000000 COST( 3, 4) 398.4000 0.000000 COST( 3, 5) 147.6000 0.000000 COST( 3, 6) 90.00000 0.000000 COST( 3, 7) 404.4000 0.000000 COST( 3, 8) 174.0000 0.000000 COST( 3, 9) 196.8000 0.000000 COST( 3, 10) 111.6000 0.000000 X( 1, 1) 2000.000 120.0000 X( 1, 2) 0.000000 321.6000 X( 1, 3) 0.000000 184.8000 X( 1, 4) 630.0000 150.0000 X( 1, 5) 0.000000 408.0000 X( 1, 6) 0.000000 230.4000 X( 1, 7) 170.0000 156.0000 X( 1, 8) 0.000000 344.4000 X( 1, 9) 0.000000 256.8000 X( 1, 10) 0.000000 372.0000 X( 2, 1) 0.000000 157.6000 X( 2, 2) 0.000000 177.6000 X( 2, 3) 600.0000 69.60000 X( 2, 4) 0.000000 188.4000 X( 2, 5) 0.000000 367.2000

30


物资紧急调运问题(完稿1)(6).doc 将本文的Word文档下载到电脑 下载失败或者文档不完整,请联系客服人员解决!

下一篇:15秋西南交大《统计学》在线作业二 答案

相关阅读
本类排行
× 游客快捷下载通道(下载后可以自由复制和排版)

下载本文档需要支付 7

支付方式:

开通VIP包月会员 特价:29元/月

注:下载文档有可能“只有目录或者内容不全”等情况,请下载之前注意辨别,如果您已付费且无法下载或内容有问题,请联系我们协助你处理。
微信:xuecool-com QQ:370150219