复合形法解决有约束优化问题.docx

#include #include #include #include #include #include #include #define E1 0.0001#define ep 0.0001#define n 2#define k 4float af=10;int i,j;double X0n,XXn,Xkn,FFk;void produce(double An,double Bn);double an,bn;double funct1(double Cn); /objective functionint constrii(double Dn); / constrictionsvoid boundarr();double A1=0,B1=0,C1=0,D1=0,EE1=0;double funct1(double Cn)double y;y=25/(C0*C1*C1*C1);return y;int constrii(double Dn)if(50-30/(D0*D1*D1)=0)&(0.001-0.0004*D0*D1)=0)&(D0=2)&(D0=0.5)&(D1=1)return 1;else return 0;void produce(double An,double Bn) double raa;int jin,N;do/N=rand()%11;/raa=N/10.0;raa=rand();raa=raa/32767;for(i=0;in;i+)X0i=Ai+raa*(Bi-Ai);XXi=X0i;while(constrii(XX)=0);for(j=1;jk;j+)/N=rand()%11;/raa=N/10.0;raa=rand();raa=raa/32767;for(i=0;in;i+)Xji=Ai+raa*(Bi-Ai);for(j=0;jk;j+)for(i=0;in;i+)X0i=0;for(jin=0;jinj+1;jin+)X0i+=Xjini;X0i=(1/(j+1.0)*(X0i);XXi=Xji;while(constrii(XX)=0)for(i=0;iE1)for(i=0;in;i+)Xci=0;for(j=0;jk;j+)Xci+=Xji;Xci=1/(k+0.0)*Xci;for(j=0;jk;j+)for(i=0;in;i+)XXi=Xji;FFj=funct1(XX);Fh=FF0;Fg=FF0;Fl=FF0;h=0;g=0;l=0;for(j=0;jFh) /Bad pointFh=FFj;h=j;if(FFjFl) /Good pointFl=FFj;l=j;for(j=0;jFg)&(j!=h) / Second maximum pointFg=FFj;g=j;for(i=0;in;i+)Xhi=Xhi;Xgi=Xgi;Xli=Xli;EE=0;for(j=0;jk;j+)EE+=pow(FFj-funct1(Xc),2);EE=pow(1/(k+0.0)*EE),0.5);if(EE=E1)printf(n F(Xmin)=%lf,funct1(Xl);prXl=&X10;break;for(i=0;in;i+)Xci=0;for(j=0;jk;j+)if(j!=h)Xci+=Xji;Xci=1/(k-1.0)*Xci;if(constrii(Xc)=1)while(constrii(Xc)=1)for(i=0;i=funct1(Xh) if(af=ep)for(i=0;in;i+)Xhi=Xgi;elseaf=1/2.0*af;else for(i=0;in;i+)Xhi=Xri; break; elseaf=1/2.0*af; elsefor(i=0;i=0n2.0.001-0.0004*x1*x2=0n3.2=x1=4n4