Ｌｉｎｇｏ进阶篇

asdfg4 · 发表于 2005-9-14 18:36:58

大虾，我想请教@user怎么编？

冯洪涛 · 发表于 2005-9-14 19:05:29

[em01],verygood

zhf_wx2002 · 发表于 2005-9-15 05:31:20

Lingo不能算做程序,还是用Matlab7.0吧!!

dianslm · 发表于 2005-9-15 19:14:12

<TABLE fixed; WORD-BREAK: break-all" height="85%" width="95%" align=center border=0>

<TR>
<TD 9pt; LINE-HEIGHT: 12pt" vAlign=top width=* height="100%"><IMG src="http://www.shumo.com/bbs/Skins/Default/topicface/face1.gif"> Lingo和Matlab各有优点和不足！</TD></TR></TABLE>

dianslm · 发表于 2005-9-15 19:16:55

<

>建模97（A）无108个大循环的Matlab程序
<

>global ff0; x=[0.12,0.23,0.11,0.1,1.4,20,0.6]; opt(1)=0; vlb=[0.075,0.225,0.075,0.075,1.125,12,0.5625]; vub=[0.125,0.375,0.125,0.125,1.875,20,0.935]; x=constr('fun97',x,opt,vlb,vub); ff=fun971(x(1),x(2),x(3),x(4),x(5),x(6),x(7)); fprintf('%10.5f %10.5f %10.5f\n',x,ff,ff0);
<

>------------------------------------------- function [fun97,g]=fun97(x) global ff0; c=[25,50,50,50,50,25,25]; t=[0.05,0.05,0.05,0.1,0.1,0.05,0.05]; ff97=fun971(x(1),x(2),x(3),x(4),x(5),x(6),x(7));
d=t; dx=0.00001; i=1; while i<8 x0=x; x0(i)=x0(i)+dx; d(i)=(fun971(x0(1),x0(2),x0(3),x0(4),x0(5),x0(6),x0(7))-ff97)/dx; i=i+1; end z=d.*x.*t; z=z.^2; fun97=sum(c)+1000*100*(fun971(x(1),x(2),x(3),x(4),x(5),x(6),x(7))-1.5)^2+1000*100/9*sum(z); ff0=fun97; g=x(1)-0.125; ----------------------------------------- function f=fun971(x1,x2,x3,x4,x5,x6,x7) f=174.42*(x1/x5)*((x3/(x2-x1))^0.85)*(1-2.62*(1-0.36*(x2/x4)^0.56)^1.5*(x4/x2)^1.16)^0.5/(x6*x7)^0.5; ------------------------------------------

dianslm · 发表于 2005-9-15 19:18:04

<

>建模97（A）有108个大循环的多种解法的c程序
<

> float c[8][4],q[8],u[8],ff_,goodn,cpn,badn; float god[8],a[8],b[8],d00=0.01,d000=0.001,mm_f,mm_f_; int gon[8],test_n=100,d000_n=1,rrun=0,rrun_=0; void min97(int i2,int i3,int i4,int i6,int i7); float min97ff(int i2,int i3,int i4,int i6,int i7); void min97_(int i2,int i3,int i4,int i6,int i7); float f97(float q1,float q2,float q3,float q4,float q5,float q6,float q7); float f97_(float q1,float q2,float q3,float q4,float q6,float q7); float min97f(int i2,int i3,int i4,int i6,int i7); main() {float y=0,f_f=0,sum1=0,sum2=0,y_,yy=0; int i1=2,i2=0,i3=0,i4=0,i5=1,i6=0,i7=0,j,i,k,nnn,n=2,k_; float sgoodn,scpn,sbadn; a[0]=0; b[0]=0; q[0]=0; god[0]=0; gon[0]=0; for (j=0;j<9;j++) for (i=0;i<4;i++) {c[j]=0;} god[0]=0; gon[0]=0; gon[1]=2; gon[2]=2; gon[3]=2; gon[4]=1; gon[5]=1; gon[6]=2; gon[7]=2;
<> a[1]=0.075; b[1]=0.125; a[2]=0.225; b[2]=0.375; a[3]=0.075; b[3]=0.125; a[4]=0.075; b[4]=0.125; a[5]=0.1125; b[5]=0.1875; a[6]=0.12; b[6]=0.2; a[7]=0.5625; b[7]=0.935; for(i=1;i<8;i++) god=a;
 c[1][2]=25; c[2][1]=20; c[2][2]=50; c[3][1]=20; c[3][2]=50; c[3][3]=200; c[4][1]=50; c[4][2]=100; c[4][3]=500; c[5][1]=50; c[6][1]=10; c[6][2]=25; c[6][3]=100; c[7][2]=25; c[7][3]=100; for(i=1;i<20;i++) {rand();} while (1>0) { printf("\n"); printf("(quit- 1, good- 2, new- 3, rand- 4, run- 5, allrun- 6, test- 7 )\n"); scanf("%d",&nnn); if(nnn==1) break; if(nnn==6) {k=0; n=2; k_=0; printf("in a number n (int) **** (b-a)/n \n"); scanf("%d",&n); if(n<2) n=2; printf("*** time *** %f \n ",pow(n,7)/10000.0); for(i1=0;i1<n;i1++) for (i2=0;i2<n;i2++) for (i3=0;i3<n;i3++) for (i4=0;i4<n;i4++) for (i5=0;i5<n;i5++) for (i6=0;i6<n;i6++) for (i7=0;i7<n;i7++) {q[1]=a[1]+i1*(b[1]-a[1])/(n-1) ;q[2]=a[2]+i2*(b[2]-a[2])/(n-1); q[3]=a[3]+i3*(b[3]-a[3])/(n-1); q[4]=a[4]+i4*(b[4]-a[4])/(n-1); q[5]=a[5]+i5*(b[5]-a[5])/(n-1); q[6]=a[6]+i6*(b[6]-a[6])/(n-1); q[7]=a[7]+i7*(b[7]-a[7])/(n-1); /* min97_(gon[2],gon[3],gon[4],gon[6],gon[7]); */ y_=f97(q[1],q[2],q[3],q[4],q[5],q[6],q[7]); if(y_<1.51&&y_>1.49) {y=min97ff(gon[2],gon[3],gon[4],gon[6],gon[7]); } if(k==0) {min97(gon[2],gon[3],gon[4],gon[6],gon[7]); f_f=min97ff(gon[2],gon[3],gon[4],gon[6],gon[7]); } if(f_f>y) {min97(gon[2],gon[3],gon[4],gon[6],gon[7]); f_f=min97ff(gon[2],gon[3],gon[4],gon[6],gon[7]); for(i=1;i<8;i++) {god=q;} printf("good=%f \n",f_f); } k=k+1; if(k-10000==0) {k_=k_+1; printf("%d ",k_); k=1; } } printf("%f %f %f %f %f %f %f \n",god[1],god[2],god[3],god[4],god[5],god[6],god[7]); printf("%d %d %d %d %d %d %d \n",gon[1],gon[2],gon[3],gon[4],gon[5],gon[6],gon[7]); printf("f=%f \n",f_f); printf("f97=%f \n",f97(god[1],god[2],god[3],god[4],god[5],god[6],god[7])); for(i=1;i<8;i++) {q=god;}
 sum1=0; sum2=0; printf("in a number(int) test_n==\n"); scanf("%d",&test_n); printf("f97=%f \n",f97(q[1],q[2],q[3],q[4],q[5],q[6],q[7])); for(i=0;i<10;i++) {f_f=min97f(gon[2],gon[3],gon[4],gon[6],gon[7]); printf("have f== %f %f \n",f_f,mm_f); sum1=sum1+f_f; sum2=sum2+mm_f*1.0; } sum1=sum1/10.0; sum2=sum2/10.0; printf("sum *** have f/10== %f %f \n",sum1,sum2); printf("%f %f %f %f %f %f %f \n",q[1],q[2],q[3],q[4],q[5],q[6],q[7]);
 i1=2; i5=1; }
 if(nnn==2) {printf("in a number(int) run-new-- 1, good-- 0, \n"); scanf("%d",&rrun); if(rrun>0) {nnn=4; rrun_=1; } if(rrun==0) {god[1]=0.075; god[2]=0.375; god[3]=0.125; god[4]=0.1185; god[5]=0.11616; god[6]=0.1996; god[7]=0.5638; gon[1]=2; gon[2]=2; gon[3]=2; gon[4]=1; gon[5]=1; gon[6]=2; gon[7]=2; } } if(nnn==3) {k_=0; gon[1]=2; gon[2]=1; gon[3]=1; gon[4]=1; gon[5]=1; gon[6]=1; gon[7]=2; god[1]=0.1; god[2]=0.3; god[3]=0.1; god[4]=0.1; god[5]=0.15; god[6]=0.16; god[7]=0.75; printf("in a number(int) new-- 1, old-- 0, \n"); scanf("%d",&k_); if(k_==1) {for(i=1;i<8;i++) { printf(" in 7 number(float) %f ", god); scanf("%f",&yy); god=yy; } for(i=1;i<8;i++) { printf(" in 7 number(int) %d ", gon); scanf("%d",&k_); gon=k_; } printf("%f %f %f %f %f %f %f \n",god[1],god[2],god[3],god[4],god[5],god[6],god[7]); printf("%d %d %d %d %d %d %d \n",gon[1],gon[2],gon[3],gon[4],gon[5],gon[6],gon[7]); } } if(nnn==4) {for(i=1;i<8;i++) {god=(b-a)*rand(); god=god/32767.0; god=a+god; } if(rrun>0) nnn=5; } for (i=1;i<8;i++) {q=god; u=god;} if(nnn==7) {sum1=0; sum2=0; sgoodn=0; scpn=0; sbadn=0; printf("in a number(int) test_n>1 , 1--> d00/10 \n"); scanf("%d",&test_n); if(test_n==1) {d00=d00/10.0; d000=d000/10.0; min97(gon[2],gon[3],gon[4],gon[6],gon[7]); for(i=1;i<8;i++) {god=q;} } printf("f97=%f \n",f97(q[1],q[2],q[3],q[4],q[5],q[6],q[7])); for(i=0;i<10;i++) {f_f=min97f(gon[2],gon[3],gon[4],gon[6],gon[7]); printf("have f== %f %f \n",f_f,mm_f); sum1=sum1+f_f; sum2=sum2+mm_f; sgoodn=sgoodn+goodn; scpn=scpn+cpn; sbadn=sbadn+badn; } sum1=sum1/10.0; sum2=sum2/10.0; sgoodn=sgoodn/10.0; scpn=scpn/10.0; sbadn=sbadn/10.0; printf("goodn=%f cpn=%f badn=%f\n",sgoodn,scpn,sbadn); printf("sum *** have f/10== %f %f \n",sum1,sum2); printf(" %f %f %f %f %f %f %f \n",q[1],q[2],q[3],q[4],q[5],q[6],q[7]); printf("%d %d %d %d %d %d %d \n",gon[1],gon[2],gon[3],gon[4],gon[5],gon[6],gon[7]); } if(nnn==5||rrun_>0) { printf("in a number(int) test_n==\n"); scanf("%d",&test_n); printf("in a number(float) step_d00==\n"); scanf("%f",&d00); d000_n=1; printf("in a number( int n ) step_d00/10^^n==\n"); scanf("%d",&d000_n); d000=d00/pow(10.0,d000_n); printf("test_n=%d step_d00=%f d000_n=%d \n",test_n,d00,d000_n); rrun_=0; } if(nnn==5) { k=0; if(rrun==0) f_f=min97f(gon[2],gon[3],gon[4],gon[6],gon[7]); if(rrun>0) f_f=min97ff(gon[2],gon[3],gon[4],gon[6],gon[7]); mm_f_=mm_f; for (i2=1;i2<3;i2++) for (i3=1;i3<4;i3++) for (i4=1;i4<4;i4++) for (i6=1;i6<4;i6++) for (i7=2;i7<4;i7++) {
 if(rrun>0) {min97(i2,i3,i4,i6,i7); y=min97ff(i2,i3,i4,i6,i7); if(f_f>y) {f_f=y; mm_f_=mm_f; for(i=1;i<8;i++) {god=q;} printf("\n"); printf("good=%f %f %d %d %d %d %d %d %d \n",f_f,mm_f_,i1,i2,i3,i4,i5,i6,i7); gon[2]=i2; gon[3]=i3; gon[4]=i4; gon[6]=i6; gon[7]=i7; } for (i=1;i<8;i++) {q=u; } k=k+1; printf("%d ",k);
 }
 if(rrun==0) {min97_(i2,i3,i4,i6,i7); y=min97f(i2,i3,i4,i6,i7); if(f_f>y) {f_f=y; mm_f_=mm_f; for(i=1;i<8;i++) {god=q;} printf("\n"); printf("good=%f %f %d %d %d %d %d %d %d \n",f_f,mm_f_,i1,i2,i3,i4,i5,i6,i7); gon[2]=i2; gon[3]=i3; gon[4]=i4; gon[6]=i6; gon[7]=i7; } for (i=1;i<8;i++) {q=u; } k=k+1; printf("%d ",k); } } printf("\n"); printf("%f %f %f %f %f %f %f \n",u[1],u[2],u[3],u[4],u[5],u[6],u[7]); printf("%f %f %f %f %f %f %f \n",god[1],god[2],god[3],god[4],god[5],god[6],god[7]); printf("%d %d %d %d %d %d %d \n",gon[1],gon[2],gon[3],gon[4],gon[5],gon[6],gon[7]); printf("f=%f %f\n",f_f,mm_f_); printf("f97=%f \n",f97(god[1],god[2],god[3],god[4],god[5],god[6],god[7])); for(i=1;i<8;i++) q=god; min97f(gon[2],gon[3],gon[4],gon[6],gon[7]); for(i=0;i<10;i++) printf("%f %f ",min97f(gon[2],gon[3],gon[4],gon[6],gon[7]),mm_f); } } } float min97ff(int i2,int i3,int i4,int i6,int i7) {int t[8],i,j_; float ff=0,ff_,ff_0,f0,f[11],r[8],ccf; t[0]=0; t[1]=2; t[2]=i2; t[3]=i3; t[4]=i4; t[5]=1; t[6]=i6; t[7]=i7; f[0]=0; r[0]=0; ccf=0; for(i=1;i<8;i++) {if(t==1) r=0.1; if(t==2) r=0.05; if(t==3) r=0.01; j_=t; ccf=ccf+c[j_]; } f[8]=1-0.36*pow(q[2]/q[4],0.56); f[9]=pow(f[8],1.5); f[10]=1-2.62*f[9]*pow(q[4]/q[2],1.16);
 f0=f97(q[1],q[2],q[3],q[4],q[5],q[6],q[7]); f[1]=f0*(1/q[1]+0.85/(q[2]-q[1])); f[2]=1.5*pow(f[8],0.5)*(-0.36)*(0.56)*pow(q[4],0.6)*pow(q[2],-1.6); f[2]=(-1.16)*f[9]*pow(q[4],1.16)*pow(q[2],-2.16)+f[2]; f[2]=0.5*f0/f[10]*(-2.62)*f[2]; f[2]=-0.85*f0/(q[2]-q[1])+f[2]; f[3]=0.85*f0/q[3]; f[4]=1.16*f[9]*pow(q[4],0.16)/pow(q[2],1.16); f[4]=f[4]+1.5*pow(f[8],0.5)*0.36*0.56*pow(q[4],-0.4)/pow(q[2],0.6); f[4]=0.5*f0*(1/f[10])*(-2.62)*f[4]; f[5]=f0/q[5]; f[6]=f0/(2*q[6]); f[7]=f0/(2*q[7]); ff=f0-1.5; ff_=0; for(i=1;i<8;i++) {ff_0=r*q*f/3.0; ff_=ff_+100000*ff_0*ff_0; } ff=100000*ff*ff+ff_+ccf; return(ff);
 } void min97(int i2,int i3,int i4,int i6,int i7) {int i=1,j,rr=0,kk=0,kkk=0; float f0,qf[8],qx[8],d0,rr0,rrr,qq_5; for(i=1;i<8;i++) {qf=q; qx=q;} rr0=min97ff(i2,i3,i4,i6,i7); d0=d00; i=1; while (1>0) { if(rr==0) {q=q+d0;} if((q<=b)&&(rr==0)) { rrr=min97ff(i2,i3,i4,i6,i7); if(rrr>=rr0) {q=q-d0; rr=1;} if(rrr<rr0) {rr0=rrr; } } if(q>b) {q=q-d0; rr=1;}
 if(rr==1) {q=q-d0;} if((q>=a)&&(rr==1)) { rrr=min97ff(i2,i3,i4,i6,i7); if(rrr>=rr0) {q=q+d0;} if(rrr<rr0) {rr0=rrr; }
 } if(q<a) {q=q+d0;} i=i+1;
 rr=0; kk=0; kkk=0; if((i==8)&&(d0>=d000)) { for(kk=1;kk<8;kk++) {if((q[kk]-qf[kk]>-0.000001)&&(q[kk]-qf[kk]<0.000001)) kkk=kkk+1; }
 if(kkk==7) {d0=d0/10.0; } if(kkk<7) {for(kk=1;kk<8;kk++) { qf[kk]=q[kk]; } } i=1; } if(d0<d000) { break; }
 } }
 void min97_(int i2,int i3,int i4,int i6,int i7) {int i=1,j,rr=0,kk=0,kkk=0; float f0,qf[8],qx[8],d0,rr0,rrr; for(i=1;i<8;i++) {qf=q; qx=q;} rr0=min97f(i2,i3,i4,i6,i7); d0=d00; i=1; while (1>0) { if(rr==0) {q=q+d0;} if((q<=b)&&(rr==0)) { rrr=min97f(i2,i3,i4,i6,i7); if(rrr>=rr0) {q=q-d0; rr=1;} if(rrr<rr0) {rr0=rrr; } } if(q>b) {q=q-d0; rr=1;}
 if(rr==1) {q=q-d0;} if((q>=a)&&(rr==1)) { rrr=min97f(i2,i3,i4,i6,i7); if(rrr>=rr0) {q=q+d0;} if(rrr<rr0) {rr0=rrr; }
 } if(q<a) {q=q+d0;}
 i=i+1;
 rr=0; kk=0; kkk=0; if((i==8)&&(d0>=d000)) { for(kk=1;kk<8;kk++) {if((q[kk]-qf[kk]>-0.000001)&&(q[kk]-qf[kk]<0.000001)) kkk=kkk+1; }
 if(kkk==7) {d0=d0/10.0; } if(kkk<7) {for(kk=1;kk<8;kk++) { qf[kk]=q[kk]; } } i=1; } if(d0<d000) { break; }
 } }
 float f97_(float q1,float q2,float q3,float q4,float q6,float q7) {float f,f1,f2,f3,f4; f1=pow(q2/q4,0.56); f2=pow(q4/q2,1.16); f3=1-2.62*pow(1.0-0.36*f1,1.5)*f2; f3=(f3/q6)/q7; f3=sqrt(f3); f4=q3/(q2-q1); f=1.7442*q1*pow(f4,0.85)*f3/1.5; return(f); }
float f97(float q1,float q2,float q3,float q4,float q5,float q6,float q7) {float f,f1,f2,f3,f4; f1=pow(q2/q4,0.56); f2=pow(q4/q2,1.16); f3=1-2.62*pow(1.0-0.36*f1,1.5)*f2; f3=(f3/q6)/q7; f3=sqrt(f3); f4=q3/(q2-q1); f=1.7442*q1*pow(f4,0.85)*f3/q5; return(f); }
float min97f(int i2,int i3,int i4,int i6,int i7) {float f=0,yy,y,m,tt,t[8],aa[8],bb[8],rra[8],rrb[8],x[8]; int i,j; goodn=0; cpn=0;badn=0; t[0]=0; aa[0]=0; bb[0]=0; rra[0]=0; rrb[0]=0; x[0]=0; t[0]=0; t[1]=2; t[2]=i2; t[3]=i3; t[4]=i4; t[5]=1; t[6]=i6; t[7]=i7; tt=0; for(i=1;i<8;i++) {aa=q; if(t==1) {bb=0.1*q/3; } if(t==2) {bb=0.05*q/3;} if(t==3) {bb=0.01*q/3;} j=t; tt=tt+c[j]; } j=0; m=0; mm_f=0; while(1>0) {for(i=1;i<8;i++) {rra=rand(); rrb=rand(); rra=rra/32767.0000; rrb=rrb/32767.0000; if(rra<0.000001) rra=0.000001; if(rrb<0.000001) rrb=0.000001; rra=sqrt(-2*log(rra))*cos(2*3.1415*rrb); x=aa+bb*rra; } yy=f97(x[1],x[2],x[3],x[4],x[5],x[6],x[7]); y=100*(yy-1.5)*(yy-1.5);
 if((yy-1.5)*(yy-1.5)<=0.1*0.1) goodn=goodn+1.0; if(0.1*0.1<(yy-1.5)*(yy-1.5)&&(yy-1.5)*(yy-1.5)<=0.3*0.3) cpn=cpn+1.0; if((yy-1.5)*(yy-1.5)>0.3*0.3) badn=badn+1.0; m=m+y; j=j+1; if(j==test_n) {mm_f=test_n*tt/1000.0+cpn+9*badn; mm_f=mm_f/10.0; break; } } f=m+test_n*tt/1000.0; f=f/10.0; return(f); }

dianslm · 发表于 2005-9-15 19:24:42

<

>建模99（A）共有3个问，当年能做对第一问的就是全国一等奖，至今能做全做对3个问的论文极少见，本网站有3个问均正确解出的论文下载（进网站99年建模论文下载区），
<

>用Mathematica来求解模型，利用网格法对x,y进行搜索。模型(3)的程序为： Module[{t,x,y,gg99,gg98,ee,m,ee1,ee2,ee3,een,n,k,i, p=0.98,q=0.02,r=0.4,s=0.6},x=10; While[x<30,x=x+1; y=300; While[y<350, n=Floor[y/x];k=Floor[t/x]; gg99=(1/(196.629*(2*Pi)^0.5)*E^(-(t-600)^2/(2*196.629^2))); gg98=1510*k*q^2+200*t*q+10*k+s*200*((k+1)*x-t); ee1=NIntegrate[gg98*gg99,{t,0,x*n}] +Sum[NIntegrate[(1000+s*200*(y-n*x+i*x)+(i+1)*10)*(1-s^2)^(i+1)* gg99,{t,x*(n-i-1),x*(n-i)}],{i,0,9}] +Sum[NIntegrate[(3000+s*200*i*x+(i+1)*20)*(1-s^2)^i*s^2* gg99,{t,0,x*(n-i)}],{i,0,9}]; ee2=NIntegrate[(1510*n*q^2+10*n+200*t*q+s*200*(y*TBG3333t)+1000)* gg99,{t,x*n,y}]; ee3=NIntegrate[(1510*n*q^2+n*10+200*y*q+1000)*gg99,{t,y,2000}]; ee=ee1+ee2+ee3; ee99=ee; een=NIntegrate[(p*t+r*((k+1)*x-t))*gg99,{t,0,n*x}] +Sum[NIntegrate[r*(y-n*x+i*x)*(1-s^2)^(i+1)*gg99,{t,x*(n-i-1),x*(n-i)}],{i,0,9}] +Sum[NIntegrate[(r*i*x)*(1-s^2)^i*s^2*gg99,{t,0,x*(n-i)}],{i,1,9}] +NIntegrate[(p*t+r*(y-t))*gg99,{t,n*x,y}] +NIntegrate[p*y*gg99,{t,y,2000}]; a=NIntegrate[gg99,{t,y,2000}]; ee=ee/een+a*s*200*x*(0.5+Sum[i*(1-s^2)^i,{i,1,10}]*s^2)/11400 +a*10*s^2*Sum[(i+1)*(1-s^2)^i,{i,1,5}]/11400+2500/11400; Print[" "ee," "ee99/een," "ee99," "een," "y," "x," "ee1," "ee2]; y=y+1 ] ] ] 模型（1） x=18 y=359 4.81元；无5%时： x=18 y=359 4.47元。 比较 x=18 y=360 4.93元； x=18 y=360 4.60元； 模型（2） x=45 y=314 10.12元；无5%时： x=53 y=316 9.34元。 比较 x=45 y=315 10.38元； x=52 y=314 9.6元； 模型（3） x=14 y=335 9.60元；无5%时： x=23 y=321 9.05元。 比较 x=14 y=336 9.68元； x=23 y=322 9.15元。

dianslm · 发表于 2005-9-15 19:27:31

上程序解的是第3个问，顺便给出了全部问的解

maomao520 · 发表于 2005-9-15 23:20:14

<

>我们一般都喜欢用LINDO，不知道他们间有没有相同的地方？？

20034920 · 发表于 2005-9-16 02:46:01

<

>楼主啊！
<

>@user() 怎么用啊？

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