机械优化设计c语言程序

1、计算 f(x1,x2)=x02+x12-x0*x1-10*x0-4*x1+60 #include stdio.h#include stdlib.h#include math.hdouble objf(double x)double ff;ff=x0*x0+x1*x1-x0*x1-10*x0-4*x1+60;return(ff);void jtf(double x0,double h0,double s,int n,double a,double b)int i;double *x3,h,f1,f2,f3;for(i=0;i3;i+)xi=(double *)malloc(n*sizeof(do

2、uble);h=h0;for(i=0;in;i+)*(x0+i)=x0i;f1=objf(x0);for(i=0;i=f1)h=-h0; for(i=0;in;i+) *(x2+i)=*(x0+i); f3=f1; for(i=0;in;i+) *(x0+i)=*(x1+i); *(x1+i)=*(x2+i); f1=f2; f2=f3; for(;) h=2*h; for(i=0;in;i+) *(x2+i)=*(x1+i)+h*si; f3=objf(x2); if(f2f3) break; else for(i=0;in;i+) *(x0+i)=*(x1+i); *(x1+i)=*(x2

3、+i); f1=f2; f2=f3; if(h0) for(i=0;in;i+) ai=*(x2+i); bi=*(x0+i); else for(i=0;in;i+) ai=*(x0+i); bi=*(x2+i); for(i=0;i3;i+) free(xi);double gold(double a,double b,double eps,int n,double xx)int i;double f1,f2,*x2,ff,q,w;for(i=0;i2;i+)xi=(double *)malloc(n*sizeof(double);for(i=0;if2) for(i=0;in;i+) b

4、i=*(x0+i); *(x0+i)=*(x1+i); f1=f2; for(i=0;in;i+) *(x1+i)=ai+0.382*(bi-ai); f2=objf(x1); else for(i=0;in;i+) ai=*(x1+i); *(x1+i)=*(x0+i); f2=f1; for(i=0;in;i+) *(x0+i)=ai+0.618*(bi-ai); f1=objf(x0); q=0;for(i=0;ieps);for(i=0;in;i+) xxi=0.5*(ai+bi);ff=objf(xx);for(i=0;i2;i+)free(xi);return(ff);double

5、 oneoptim(double x0,double s,double h0,double epsg,int n,double x)double *a,*b,ff;a=(double *)malloc(n*sizeof(double);b=(double *)malloc(n*sizeof(double);jtf(x0,h0,s,n,a,b);ff=gold(a,b,epsg,n,x);free(a);free(b);return (ff);double powell(double p,double h0,double eps,double epsg,int n,double x)int i,

6、j,m;double *xx4,*ss,*s;double f,f0,f1,f2,f3,fx,dlt,df,sdx,q,d;ss=(double *)malloc(n*(n+1)*sizeof(double);s=(double *)malloc(n*sizeof(double);for(i=0;in;i+)for(j=0;j=n;j+) *(ss+i*(n+1)+j)=0; *(ss+i*(n+1)+i)=1;for(i=0;i4;i+)xxi=(double *)malloc(n*sizeof(double);for(i=0;in;i+)*(xx0+i)=pi;for(;)for(i=0;

7、in;i+) *(xx1+i)=*(xx0+i); xi=*(xx1+i); f0=f1=objf(x); dlt=-1; for(j=0;jn;j+) for(i=0;idlt) dlt=df; m=j; sdx=0; for(i=0;in;i+) sdx=sdx+fabs(xi-(*(xx1+i); if(sdxeps) free(ss); free(s); for(i=0;i4;i+) free(xxi); return(f); for(i=0;in;i+) *(xx2+i)=xi; f2=f; for(i=0;in;i+) *(xx3+i)=2*(*(xx2+i)-(*(xx1+i);

8、 xi=*(xx3+i); fx=objf(x); f3=fx; q=(f1-2*f2+f3)*(f1-f2-dlt)*(f1-f2-dlt); d=0.5*dlt*(f1-f3)*(f1-f3); if(f3f1)|(qd) if(f2=f3) for(i=0;in;i+) *(xx0+i)=*(xx2+i); else for(i=0;in;i+) *(xx0+i)=*(xx3+i); else for(i=0;in;i+) *(ss+(i+1)*(n+1)=xi-(*(xx1+i); *(s+i)=*(ss+(i+1)*(n+1); f=oneoptim(xx0,s,h0,epsg,n,

9、x); for(i=0;in;i+) *(xx0+i)=xi; for(j=m+1;j=n;j+) for(i=0;in;i+) *(ss+i*(n+1)+j-1)=*(ss+i*(n+1)+j); void main()double p=1,2;double ff,x2;ff=powell(p,0.3,0.001,0.0001,2,x);printf(x0=%f,x1=%f,ff=%fn,x0,x1,ff);getchar(); #include #include void main() float x120,x220, y20, a20; float X1, X2, ymin, e; in

10、t k; printf(input x10 x20 en); scanf(%f,%f,%f,&x10,&x20,&e); printf(x1ttx2ttyttan); k=0; do ak=(625*x2k*x2k+x1k*x1k)/ (2*x1k*x1k+625*50*x2k*x2k); x1k+1=x1k-ak*2*x1k; x2k+1=x2k-ak*50*x2k; yk+1=x1k+1*x1k+1+25*x2k+1*x2k+1; printf(n%ft%ft%ft%ft,x1k+1,x2k+1,yk+1,ak); k=k+1; while (x1k-x1k-1)e) if(y1=y2)

11、a=a1; a1=a2;y1=y2; a2=a+k*(b-a); y2=f(a2); else b=a2; a2=a1; y2=y1; a1=b-k*(b-a); y1=f(a1); printf(%f %f %f %f %f %fn,a,a1,a2,b,y1,y2); printf(x*=%fn,(a1+a2)/2); printf(y*=%fn,y1); 4、抓屏结果 ABCDEFGHIJKLMNabcdefghijklmn!#$%&*()_+.一三五七九贰肆陆扒拾，。青玉案元夕东风夜放花千树更吹落星如雨宝马雕车香满路凤箫声动玉壶光转一夜鱼龙舞蛾儿雪柳黄金缕笑语盈盈暗香去众里寻他千百度暮然回首那人却在灯火阑珊处窗体顶端窗体底端你可能喜欢优化设计进退法 鲍威尔法 优化设计黄金分割法 优化设计Matlab. 机械