运筹学课程设计案例

1321223 2009-01-07 | rar | 11264 | 次下载 | 免费

资料介绍

模型的lingo语言描述如下
1）为该市设计一个从各集散点至各菜市场的定点供应方案，使用于蔬菜调运及预期的短缺损失为最小；
MODEL:
SETS:
jsd/1..3/:a;!三个集散地,收购量a(i);
csc/1..8/:b;!八个菜市场，每天需求量b(j);
dqss/1..8/:d;!各菜市场的单位短缺损失d(j);
j_c(jsd,csc):x,c,l;!i到j的距离矩阵为l(i,j),单位运费c(i,j),决策变量为 x(i,j);
ENDSETS
DATA:
a=200,170,160;
b=75,60,80,70,100,55,90,80;
d=10,8,5,10,10,8,5,8;
l=4,8,8,19,11,6,22,26,
? 14,7,7,16,12,16,23,17,
? 20,19,11,14,6,15,5,10;
c=1,1,1,1,1,1,1,1,
? 1,1,1,1,1,1,1,1,
? 1,1,1,1,1,1,1,1;
ENDDATA
@for(jsd(i):
??? [st1]@sum(csc(j):x(i,j))=a(i));!收购量限制;
@for(csc(j):
??? [st2]@sum(jsd(i):x(i,j))<=b(j));!需求量限制;
[obj]min=@sum(jsd(i):@sum(csc(j):c(i,j)*x(i,j)*l(i,j)))
+@sum(jsd(i):@sum(csc(j):d(j)*(b(j)-x(i,j))));
END
模型求解的结果如下
Global optimal solution found at iteration:??????????? 11
? Objective value:???????????????????????????????? 14330.00
?????????????????????? Variable?????????? Value??????? Reduced Cost
????????????????????????? A( 1)??????? 200.0000??????????? 0.000000
????????????????????????? A( 2)??????? 170.0000??????????? 0.000000
????????????????????????? A( 3)??????? 160.0000??????????? 0.000000
????????????????????????? B( 1)??????? 75.00000??????????? 0.000000
????????????????????????? B( 2)??????? 60.00000??????????? 0.000000
????????????????????????? B( 3)??????? 80.00000??????????? 0.000000
????????????????????????? B( 4)??????? 70.00000??????????? 0.000000
????????????????????????? B( 5)??????? 100.0000??????????? 0.000000
????????????????????????? B( 6)??????? 55.00000??????????? 0.000000