优化设计复合形法 C语言程序.doc

题目：求如下约束优化问题的最优解 ()= S.t. 已知：N=2，取k=4，#include math.h#include stdio.h#include stdlib.h#define E1 0.001#define ep 0.00001#define n 2#define k 4double af;int i, j;double X0n,XXn,Xkn,FFk;double an,bn;double rm=2657863.0;double F(double Cn)double F;F=pow(C0-3,2)+pow(C1-4,2);return F;int cons(double Dn)if(D0=0)&(D1=0)&(D0=6)&(D1=0)&(5-D0-D1)=0)return 1;elsereturn 0;void bou()a0=0;b0=6;a1=0;b1=8;double r()double r1,r2,r3,rr;r1=pow(2,35);r2=pow(2,36);r3=pow(2,37);rm=5*rm;if(rm=r3)rm=rm-r3;if(rm=r2)rm=rm-r2; if(rm=r1)rm=rm-r1;rr=rm/r1;return rr;void produce(double An,double Bn)int jj;double S;sl: for(i=0;in;i+) S=r(); XXi=Ai+S*(Bi-Ai); if(cons(XX)=0) goto sl; for(i=0;in;i+)X0i=XXi;for(j=1;jk;j+)for(i=0;in;i+)S=r();Xji=Ai+S*(Bi-Ai);for(j=1;jk;j+)for(i=0;in;i+)X0i=0;for(jj=1;jjj+1;jj+)X0i+=Xjji;X0i=(1/j)*(X0i);if(cons(X0)=0)goto sl;for(i=0;in;i+)XXi=Xji;while(cons(XX)=0)for(i=0;in;i+)Xji=X0i+0.5*(Xji-X0i);XXi=Xji;main()double EE,Xcn,Xhn,Xgn,X1n,Xrn,Xsn,w;int l, lp, lp1;bou();s111:produce(a,b);s222:for(j=0;jk;j+) for(i=0;in;i+) XXi=Xji; FFj=F(XX); for(l=0;lk-1;l+) for(lp=0;lpk-1;lp+) lp1=lp+1; if(FFlpFFlp1) w=FFlp;FFlp=FFlp1;FFlp1=w; for(i=0;in;i+) XXi=Xlpi;Xlpi=Xlp1i;Xlp1i=XXi; for(i=0;in;i+)Xhi=X0i;Xgi=X1i;X1i=Xk-1i;for(i=0;in;i+)Xsi=0;for(j=0;jk;j+)Xsi+=Xji;Xsi=1/(k+0.0)*Xsi;EE=0;for(j=0;jk;j+)EE+=pow(FFj-F(Xs),2);EE=pow(1/(k+0.0)*EE),0.5);if(EE=E1) goto s333;for(i=0;in;i+)Xci=0;for(j=1;jk;j+)Xci+=Xji;Xci=1/(k-1.0)*Xci;if(cons(Xc)=1)af=1.3;ss:for(i=0;i=F(Xh) if(af=ep) for(i=0;in;i+) Xhi=Xgi; af=1.3;goto ss; else af=1/2.0*af;goto ss; else for(i=0;in;i+) X0i=Xri; goto s222; else af=1/2.0*af;goto ss; else for(i=0;in;i+) if(X1iXci) ai=X1i;bi=Xci; else ai=Xci;bi=X1i; goto