数模论坛

 找回密码
 注-册-帐-号
搜索
热搜: 活动 交友 discuz
查看: 4986|回复: 1

lingo线性规划问题

[复制链接]
发表于 2007-4-7 05:54:12 | 显示全部楼层 |阅读模式
MODEL:<br/>SETS:<br/>venders1/v1,v2/:c1,x1;<br/>goods1/g1,g2/:h1,i1,m1,o1;<br/>vg1(venders1,goods1):q1,d1,z1,g1,b1,p1;<br/>venders2/s1,s2/:c2,x2;<br/>goods2/w1,w2/:h2,i2,m2,o2;<br/>vg2(Venders2,goods2):q2,d2,z2,g2,b2,p2;<br/>ENDSETS<br/>DATA:<br/>c1= 1200,2000;<br/>h1= 1,1.5;<br/>m1= 3500,4000;<br/>q1= 0.04 0.02<br/>&nbsp;&nbsp;&nbsp; 0.03 0.04;<br/>d1= 0.18 0.09<br/>&nbsp;&nbsp;&nbsp; 0.2 0.1;<br/>g1= 2 1.8<br/>&nbsp;&nbsp;&nbsp; 1 0.8;<br/>b1= 3000 5000<br/>&nbsp;&nbsp;&nbsp; 3000 4000;<br/>p1= 5 5.1<br/>&nbsp;&nbsp;&nbsp; 2.2 2.1;<br/>c2= 1200,2000;<br/>h2= 1,1.5;<br/>m2= 3200,3500;<br/>q2= 0.04 0.02<br/>&nbsp;&nbsp;&nbsp; 0.03 0.04;<br/>d2= 0.18 0.09<br/>&nbsp;&nbsp;&nbsp; 0.2 0.1;<br/>G2= 2 1.8<br/>&nbsp;&nbsp;&nbsp; 1 0.8;<br/>b2= 3500 4500<br/>&nbsp;&nbsp;&nbsp; 3000 4000;<br/>p2= 5 5.1<br/>&nbsp;&nbsp;&nbsp; 2.2 2.1;<br/>o1=100,80;<br/>o2=100,80;<br/>i1= 0,0;<br/>ENDDATA<br/><a href="mailto:min=@sum(vg1(I,J)1(I,J)*z1(I,J))+@sum(venders1:x1*c1)+@sum(vg1(i,j):g1(i,j)*z1(i,j))+@sum(goods1:h1*i1)+@sum(vg2(i,j)2(i,j)*z2(i,j))+@sum(venders2:x2*c2)+@sum(vg2(i,j):g2(i,j)*z2(i,j)+@sum(goods2:h2*i2">min=@sum(vg1(I,J)1(I,J)*z1(I,J))+@sum(venders1:x1*c1)+@sum(vg1(i,j):g1(i,j)*z1(i,j))+@sum(goods1:h1*i1)+@sum(vg2(i,j):P2(i,j)*z2(i,j))+@sum(venders2:x2*c2)+@sum(vg2(i,j):g2(i,j)*z2(i,j)+@sum(goods2:h2*i2</a>));<br/>@FOR(vg1(i,j):z1(i,j)&lt;=b1(i,j));<br/>@for(vg2(i,j):z2(i,j)&lt;=b2(i,j));<br/>@for(goods1:m1(j)+1.28*o1(j)&lt;=i1(j)+@sum(venders1(i):z1(i,j));<br/>@for(goods2:m2(j)+1.28*o2(j)&lt;=i2(j)+@sum(venders2(i):z2(i,j));<br/>i2(j)=i1(j)+@sum(goods2(j):z2(i,j)-m2(j));<br/>x1(j)=@if(z1(i,j)#gt#0,1,0);<br/>x2(j)=@if(z2(i,j)#gt#0,1,0);<br/>end<br/>最后5句都有问题,自己能力实在太差了,请高手指点改如何修改.可以加QQ81894565指教!感谢万分!
发表于 2007-4-12 17:31:59 | 显示全部楼层

请哪位高手帮我看看这个LINGO程序啊?

model:<br/>&nbsp; sets:<br/>&nbsp; distri/D1..D22/uanty,Time;<br/>&nbsp; order/j1..j22/;<br/>&nbsp; links(distri,order): cost,volume;<br/>endsets<br/>&nbsp; !目标函数;<br/>&nbsp; <a href="mailto:min=@sum(links">min=@sum(links</a>: cost*volume);<br/>&nbsp; !约束条件;<br/>&nbsp; @for(distri(I):<br/>&nbsp;&nbsp;&nbsp; @sum(order(J): volume(I,J))=1;<br/>&nbsp; );<br/>&nbsp; !约束条件;<br/>&nbsp; @for(order(J):<br/>&nbsp;&nbsp;&nbsp; @sum(distri(I): volume(I,J))=1;<br/>&nbsp; );<br/>&nbsp; !约束条件;&nbsp;&nbsp; <br/>&nbsp;&nbsp; @for(distri(I):<br/>&nbsp;&nbsp;&nbsp; @sum(distri(I):<br/>&nbsp;&nbsp;&nbsp; volume(I,J)*Time(I) )&lt;=240;<br/>&nbsp; !约束条件;&nbsp;&nbsp; <br/>&nbsp;&nbsp; @for(distri(I):<br/>&nbsp;&nbsp;&nbsp; @sum(distri(I):<br/>&nbsp;&nbsp; volume(I,J)* Quanty(I) )&lt;=3.36;&nbsp; <br/>data: <br/>&nbsp; cost=0.057 0.041 0.038 0.028 0.037 0.048 0.032 0.058 0.037 0.037 0.052 0.040 0.024 0.027 0.033 0.031 0.043 0.034 0.041 0.045 0.025 0.0314;<br/>&nbsp;&nbsp; Quanty=0.3 0.3 0.3 0.3 0.3 0.3 0.3 0.3 0.3 0.3 0.3 0.3 0.1 0.3 0.2 0.3 0.3 0.3 0.3 0.3 0.2 0.3;&nbsp; <br/>&nbsp;&nbsp; Time=7.1003 4.5130 4.7333 4.8333 7.1 9.4667 4.513 30.7667 5.2067 4.0396 17.293 7.353 69.2111 5.9074 15.9111 10.4133 33.2963&nbsp; 13.5193 15.6200 21.2815&nbsp; 4.26 3.0074 ;<br/>enddata<br/>end<br/>
您需要登录后才可以回帖 登录 | 注-册-帐-号

本版积分规则

小黑屋|手机版|Archiver|数学建模网 ( 湘ICP备11011602号 )

GMT+8, 2024-11-30 09:01 , Processed in 0.099649 second(s), 18 queries .

Powered by Discuz! X3.4

Copyright © 2001-2021, Tencent Cloud.

快速回复 返回顶部 返回列表