LINGO8.0 for windows软件及应用（编译）

wanbaocheng · 发表于 2005-7-25 20:48:12

<

>答孤胆一心
<

>1. 试试这个网址<a href="http://homepage.scau.edu.cn/club/lixue/01c4/Soft_Index.asp" target="_blank" >http://homepage.scau.edu.cn/club/lixue/01c4/Soft_Index.asp</A>
<

>要不行的话，你上网用baidu搜一下，应该能行的。
2. 你修改后的程序
model: sets: task/A B C D E F G H I J K/:t; station/1..4/:period; precede(task,task)/A,B B,C C,F C,G F,J G,J D,E E,H E,I H,J I,J J,K/; link(task,station):x; endsets data: t=45 11 9 50 15 12 12 12 12 8 9; enddata <a href="http://www.shumo.com/bbs/mailtmin=@max(station(k):period(k" target="_blank" >min=@max(station(k):period(k</A>)); @for(link

bin(x)); @for(task(i): @sum(station(k):x(i,k))=1); @for(precede(i,j): @sum(station(k):k*x(j,k)-k*x(i,k))>=0); @for(station(k): @sum(link(i,k):x(i,k)*t(i))=period(k)); end
的运行结果如下：
 Global optimal solution found at iteration: 1 Objective value: 50.00000
 Variable Value Reduced Cost T( A) 45.00000 0.000000 T( B) 11.00000 0.000000 T( C) 9.000000 0.000000 T( D) 50.00000 0.000000 T( E) 15.00000 0.000000 T( F) 12.00000 0.000000 T( G) 12.00000 0.000000 T( H) 12.00000 0.000000 T( I) 12.00000 0.000000 T( J) 8.000000 0.000000 T( K) 9.000000 0.000000 PERIOD( 1) 45.00000 0.000000 PERIOD( 2) 50.00000 0.000000 PERIOD( 3) 50.00000 0.000000 PERIOD( 4) 50.00000 0.000000 X( A, 1) 1.000000 -45.00000 X( A, 2) 0.000000 0.000000 X( A, 3) 0.000000 0.000000 X( A, 4) 0.000000 0.000000 X( B, 1) 0.000000 -11.00000 X( B, 2) 0.000000 0.000000 X( B, 3) 1.000000 0.000000 X( B, 4) 0.000000 0.000000 X( C, 1) 0.000000 -9.000000 X( C, 2) 0.000000 0.000000 X( C, 3) 0.000000 0.000000 X( C, 4) 1.000000 0.000000 X( D, 1) 0.000000 -50.00000 X( D, 2) 1.000000 0.000000 X( D, 3) 0.000000 0.000000 X( D, 4) 0.000000 0.000000 X( E, 1) 0.000000 -15.00000 X( E, 2) 0.000000 0.000000 X( E, 3) 1.000000 0.000000 X( E, 4) 0.000000 0.000000 X( F, 1) 0.000000 -12.00000 X( F, 2) 0.000000 0.000000 X( F, 3) 0.000000 0.000000 X( F, 4) 1.000000 0.000000 X( G, 1) 0.000000 -12.00000 X( G, 2) 0.000000 0.000000 X( G, 3) 0.000000 0.000000 X( G, 4) 1.000000 0.000000 X( H, 1) 0.000000 -12.00000 X( H, 2) 0.000000 0.000000 X( H, 3) 1.000000 0.000000 X( H, 4) 0.000000 0.000000 X( I, 1) 0.000000 -12.00000 X( I, 2) 0.000000 0.000000 X( I, 3) 1.000000 0.000000 X( I, 4) 0.000000 0.000000 X( J, 1) 0.000000 -8.000000 X( J, 2) 0.000000 0.000000 X( J, 3) 0.000000 0.000000 X( J, 4) 1.000000 0.000000 X( K, 1) 0.000000 -9.000000 X( K, 2) 0.000000 0.000000 X( K, 3) 0.000000 0.000000 X( K, 4) 1.000000 0.000000
 Row Slack or Surplus Dual Price 1 50.00000 -1.000000 2 0.000000 -45.00000 3 0.000000 -11.00000 4 0.000000 -9.000000 5 0.000000 -50.00000 6 0.000000 -15.00000 7 0.000000 -12.00000 8 0.000000 -12.00000 9 0.000000 -12.00000 10 0.000000 -12.00000 11 0.000000 -8.000000 12 0.000000 -9.000000 13 2.000000 0.000000 14 1.000000 0.000000 15 0.000000 0.000000 16 0.000000 0.000000 17 0.000000 0.000000 18 0.000000 0.000000 19 1.000000 0.000000 20 0.000000 0.000000 21 0.000000 0.000000 22 1.000000 0.000000 23 1.000000 0.000000 24 0.000000 0.000000 25 0.000000 0.000000 26 0.000000 1.000000 27 0.000000 1.000000 28 0.000000 1.000000

wanbaocheng · 发表于 2005-7-25 20:50:28

<

>3. model: sets: city/A B C D E F G/:u; link(city,city):price,x; endsets data: price=0 2 4 6 2 5 7 2 0 3 6 7 4 1 4 3 0 1 8 9 2 6 6 1 0 4 8 3 2 7 8 4 0 3 2 5 4 9 8 3 0 5 7 1 2 3 2 5 0; enddata <a href="http://www.shumo.com/bbs/mailtmin=@sum(link(i,j):price(i,j)*x(i,j" target="_blank" >min=@sum(link(i,j):price(i,j)*x(i,j</A>)); @for(city(j)

sum(city(i):x(i,j))=1); @for(city(i)

sum(city(j):x(i,j))=1); @for(city(i):x(i,i)=0); @for(link

bin(x)); @for(link(i,j)|i #ne# j #and# i #ge# 2:u(i)-u(j)+7*x(i,j)<=6); 
<

><a href="http://www.shumo.com/bbs/mailt!@for(city:@gin(u" target="_blank" >!@for(city:@gin(u</A>)); 删掉这一句，能够正常运行，结果是正确的；否则运行速度就变成让人不能忍受的慢。
<

>结果如下：
 Global optimal solution found at iteration: 811 Objective value: 18.00000
 Variable Value Reduced Cost U( A) 6.000000 0.000000 U( B) 3.000000 0.000000 U( C) 0.000000 0.000000 U( D) 1.000000 0.000000 U( E) 5.000000 0.000000 U( F) 4.000000 0.000000 U( G) 2.000000 0.000000 PRICE( A, A) 0.000000 0.000000 PRICE( A, B) 2.000000 0.000000 PRICE( A, C) 4.000000 0.000000 PRICE( A, D) 6.000000 0.000000 PRICE( A, E) 2.000000 0.000000 PRICE( A, F) 5.000000 0.000000 PRICE( A, G) 7.000000 0.000000 PRICE( B, A) 2.000000 0.000000 PRICE( B, B) 0.000000 0.000000 PRICE( B, C) 3.000000 0.000000 PRICE( B, D) 6.000000 0.000000 PRICE( B, E) 7.000000 0.000000 PRICE( B, F) 4.000000 0.000000 PRICE( B, G) 1.000000 0.000000 PRICE( C, A) 4.000000 0.000000 PRICE( C, B) 3.000000 0.000000 PRICE( C, C) 0.000000 0.000000 PRICE( C, D) 1.000000 0.000000 PRICE( C, E) 8.000000 0.000000 PRICE( C, F) 9.000000 0.000000 PRICE( C, G) 2.000000 0.000000 PRICE( D, A) 6.000000 0.000000 PRICE( D, B) 6.000000 0.000000 PRICE( D, C) 1.000000 0.000000 PRICE( D, D) 0.000000 0.000000 PRICE( D, E) 4.000000 0.000000 PRICE( D, F) 8.000000 0.000000 PRICE( D, G) 3.000000 0.000000 PRICE( E, A) 2.000000 0.000000 PRICE( E, B) 7.000000 0.000000 PRICE( E, C) 8.000000 0.000000 PRICE( E, D) 4.000000 0.000000 PRICE( E, E) 0.000000 0.000000 PRICE( E, F) 3.000000 0.000000 PRICE( E, G) 2.000000 0.000000 PRICE( F, A) 5.000000 0.000000 PRICE( F, B) 4.000000 0.000000 PRICE( F, C) 9.000000 0.000000 PRICE( F, D) 8.000000 0.000000 PRICE( F, E) 3.000000 0.000000 PRICE( F, F) 0.000000 0.000000 PRICE( F, G) 5.000000 0.000000 PRICE( G, A) 7.000000 0.000000 PRICE( G, B) 1.000000 0.000000 PRICE( G, C) 2.000000 0.000000 PRICE( G, D) 3.000000 0.000000 PRICE( G, E) 2.000000 0.000000 PRICE( G, F) 5.000000 0.000000 PRICE( G, G) 0.000000 0.000000 X( A, A) 0.000000 0.000000 X( A, B) 0.000000 2.000000 X( A, C) 1.000000 4.000000 X( A, D) 0.000000 6.000000 X( A, E) 0.000000 2.000000 X( A, F) 0.000000 5.000000 X( A, G) 0.000000 7.000000 X( B, A) 0.000000 2.000000 X( B, B) 0.000000 0.000000 X( B, C) 0.000000 3.000000 X( B, D) 0.000000 6.000000 X( B, E) 0.000000 7.000000 X( B, F) 1.000000 4.000000 X( B, G) 0.000000 1.000000 X( C, A) 0.000000 4.000000 X( C, B) 0.000000 3.000000 X( C, C) 0.000000 0.000000 X( C, D) 1.000000 1.000000 X( C, E) 0.000000 8.000000 X( C, F) 0.000000 9.000000 X( C, G) 0.000000 2.000000 X( D, A) 0.000000 6.000000 X( D, B) 0.000000 6.000000 X( D, C) 0.000000 1.000000 X( D, D) 0.000000 0.000000 X( D, E) 0.000000 4.000000 X( D, F) 0.000000 8.000000 X( D, G) 1.000000 3.000000 X( E, A) 1.000000 2.000000 X( E, B) 0.000000 7.000000 X( E, C) 0.000000 8.000000 X( E, D) 0.000000 4.000000 X( E, E) 0.000000 0.000000 X( E, F) 0.000000 3.000000 X( E, G) 0.000000 2.000000 X( F, A) 0.000000 5.000000 X( F, B) 0.000000 4.000000 X( F, C) 0.000000 9.000000 X( F, D) 0.000000 8.000000 X( F, E) 1.000000 3.000000 X( F, F) 0.000000 0.000000 X( F, G) 0.000000 5.000000 X( G, A) 0.000000 7.000000 X( G, B) 1.000000 1.000000 X( G, C) 0.000000 2.000000 X( G, D) 0.000000 3.000000 X( G, E) 0.000000 2.000000 X( G, F) 0.000000 5.000000 X( G, G) 0.000000 0.000000
 Row Slack or Surplus Dual Price 1 18.00000 -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 0.000000 0.000000 10 0.000000 0.000000 11 0.000000 0.000000 12 0.000000 0.000000 13 0.000000 0.000000 14 0.000000 0.000000 15 0.000000 0.000000 16 0.000000 0.000000 17 0.000000 0.000000 18 0.000000 0.000000 19 0.000000 0.000000 20 0.000000 0.000000 21 0.000000 0.000000 22 0.000000 0.000000 23 9.000000 0.000000 24 3.000000 0.000000 25 4.000000 0.000000 26 8.000000 0.000000 27 0.000000 0.000000 28 5.000000 0.000000 29 12.00000 0.000000 30 9.000000 0.000000 31 0.000000 0.000000 32 11.00000 0.000000 33 10.00000 0.000000 34 8.000000 0.000000 35 11.00000 0.000000 36 8.000000 0.000000 37 5.000000 0.000000 38 10.00000 0.000000 39 9.000000 0.000000 40 0.000000 0.000000 41 0.000000 0.000000 42 4.000000 0.000000 43 1.000000 0.000000 44 2.000000 0.000000 45 5.000000 0.000000 46 3.000000 0.000000 47 8.000000 0.000000 48 5.000000 0.000000 49 2.000000 0.000000 50 3.000000 0.000000 51 0.000000 0.000000 52 4.000000 0.000000 53 10.00000 0.000000 54 0.000000 0.000000 55 4.000000 0.000000 56 5.000000 0.000000 57 9.000000 0.000000 58 8.000000 0.000000

[此贴子已经被作者于2005-7-25 13:29:47编辑过]

CoCoYin · 发表于 2005-7-26 00:55:17

仅是翻译HELP的话，~~~~~~~~~~

wanbaocheng · 发表于 2005-7-26 02:57:16

<

>有什么意见请说出来

asdfg4 · 发表于 2005-7-26 04:05:17

<

>Email:wjwyc_27@163.com
<

>谢谢

wanbaocheng · 发表于 2005-7-27 18:38:03

已发送，请查收！

wydkv3000 · 发表于 2005-7-28 00:47:14

<

>请教斑竹一个问题：如何判定当 z(j)=0 时 w(i,j)=0？源程序如下：
<

>sets:C/1..5/:f; D/1..10/:v,k,s,z,cnum; link(C,D):w,h,x,y; endsets data:f=1.2 1.3 1.3 1.9 1.3; v=0.3 0.28 0.29 0.32 0.31 0.33 0.32 0.31 0.33 0.31; k=0.95 1.05 1.00 1.05 1.10 1.25 1.05 1.30 1.35 1.25; s=1.25 1.10 1.35 1.05 1.15 1.35 1.05 1.15 1.35 1.25; h=5.26 5.19 4.21 4.00 2.95 2.74 2.46 1.90 0.64 1.27 1.90 0.99 1.90 1.13 1.27 2.25 1.48 2.04 3.09 3.51 5.89 5.61 5.61 4.56 3.51 3.65 2.46 2.46 1.06 0.57 0.64 1.76 1.27 1.83 2.74 2.60 4.21 3.72 5.05 6.10 4.42 3.86 3.72 3.16 2.25 2.81 0.78 1.62 1.27 0.50; enddata
<

><a href="mailtmin=@sum(C(i)

sum(D(j):0.0154*w(i,j)*h(i,j" target="_blank" >min=@sum(C(i)

sum(D(j):0.0154*w(i,j)*h(i,j</A>))); @for(C(i)

sum(D(j):0.0154*w(i,j))>=f(i)); @for(D(j):@bin(z(j))); @sum(D(j):z(j))<=7; @for(D(j):0.0154*w(1,j)+0.0154*w(2,j)+0.0154*w(5,j)<=k(j)); @for(D(j):0.0154*w(3,j)+0.0154*w(4,j)<=s(j)); @sum(D(j):0.0154*w(1,j)*v(j))/@sum(D(j):0.0154*w(1,j))>=0.285; @sum(D(j):0.0154*w(1,j)*v(j))/@sum(D(j):0.0154*w(1,j))<=0.305; @sum(D(j):0.0154*w(2,j)*v(j))/@sum(D(j):0.0154*w(2,j))>=0.285; @sum(D(j):0.0154*w(2,j)*v(j))/@sum(D(j):0.0154*w(2,j))<=0.305; @sum(D(j):0.0154*w(5,j)*v(j))/@sum(D(j):0.0154*w(5,j))>=0.285; @sum(D(j):0.0154*w(5,j)*v(j))/@sum(D(j):0.0154*w(5,j))<=0.305; @for(D(j):@sum(C(i):0.0154*w(i,j))/(0.0154*12)<=8); @for(C(i):@sum(D(j):0.0154*w(i,j))/(0.0154*20)<=8); @for(link(i,j):w(i,j)=x(i,j)*y(i,j)); @for(link(i,j):@gin(x(i,j))); @for(link(i,j):@gin(y(i,j))); end

wanbaocheng · 发表于 2005-7-28 17:51:46

“如何判定当 z(j)=0 时 w(i,j)=0？”这句话能否说的再明白些

wydkv3000 · 发表于 2005-7-28 23:05:46

<

>就是 if z(j)=0 w(i,j)=0
<

>用lingo应该怎么输入这个语句呢

wanbaocheng · 发表于 2005-7-29 02:41:16

<

>我观察你的程序中的x和y没有必要，于是把w定义为整数即可，否则，程序是INLP(非线性的，规模有那么大，恐怖），超过2小时还没有结果，该完之后，程序模型为ILP,运行就很快。
<

>修改如下：
<

>sets:C/1..5/:f; D/1..10/:v,k,s,z,cnum; link(C,D):w,h,x,y; endsets data:f=1.2 1.3 1.3 1.9 1.3; v=0.3 0.28 0.29 0.32 0.31 0.33 0.32 0.31 0.33 0.31; k=0.95 1.05 1.00 1.05 1.10 1.25 1.05 1.30 1.35 1.25; s=1.25 1.10 1.35 1.05 1.15 1.35 1.05 1.15 1.35 1.25; h=5.26 5.19 4.21 4.00 2.95 2.74 2.46 1.90 0.64 1.27 1.90 0.99 1.90 1.13 1.27 2.25 1.48 2.04 3.09 3.51 5.89 5.61 5.61 4.56 3.51 3.65 2.46 2.46 1.06 0.57 0.64 1.76 1.27 1.83 2.74 2.60 4.21 3.72 5.05 6.10 4.42 3.86 3.72 3.16 2.25 2.81 0.78 1.62 1.27 0.50; enddata
<a href="mailtmin=@sum(C(i)

sum(D(j):0.0154*w(i,j)*h(i,j" target="_blank" >min=@sum(C(i)

sum(D(j):0.0154*w(i,j)*h(i,j</A>))); @for(C(i)

sum(D(j):0.0154*w(i,j))>=f(i)); @for(D(j):@bin(z(j))); @sum(D(j):z(j))<=7; @for(D(j):0.0154*w(1,j)+0.0154*w(2,j)+0.0154*w(5,j)<=k(j)); @for(D(j):0.0154*w(3,j)+0.0154*w(4,j)<=s(j)); @for(C(I) | I#ne#3 #and# I#ne#4: @sum(D(j):0.0154*w(I,j)*v(j)) >= 0.285* @sum(D(j):0.0154*w(I,j)); @sum(D(j):0.0154*w(I,j)*v(j)) <= 0.305* @sum(D(j):0.0154*w(I,j)); ); @for(D(j):@sum(C(i):0.0154*w(i,j))/(0.0154*12)<=8); @for(C(i):@sum(D(j):0.0154*w(i,j))/(0.0154*20)<=8); <a href="mailt!@for(link(i,j):w(i,j)=x(i,j)*y(i,j" target="_blank" >!@for(link(i,j):w(i,j)=x(i,j)*y(i,j</A>)); <a href="mailt!@for(link(i,j):@gin(x(i,j" target="_blank" >!@for(link(i,j):@gin(x(i,j</A>))); <a href="mailt!@for(link(i,j):@gin(y(i,j" target="_blank" >!@for(link(i,j):@gin(y(i,j</A>))); @for(link: @gin(w)); @for(D(J): @for(C(I): z(J)<w(I,J);w(I,J)<100000*z(J)) ); end

		自动登录	找回密码
密码			注-册-帐-号

LINGO8.0 for windows软件及应用（编译）

浏览过的版块