自動(dòng)化車床問題概述-資料下載頁
2025-03-26 03:33本頁面
【正文】 )*jch3+R1^(t1)*R2^(nt1)*(n1)。 elseif t==n for j=1:n2 jchn=jchn+j*R1^(j1)。 end jch(n)=(1R1)*jchn+(n1)*R1^(n2)。 jch(n+1)=jch(n)。 endif t==1 y22=0。 y32=0。elsey22=1/9*p1*k(t1)^9+1/8*p2*k(t1)^8+1/7*p3*k(t1)^7+1/6*p4*k(t1)^6+1/5*p5*k(t1)^5+1/4*p6*k(t1)^4+1/3*p7*k(t1)^3+1/2*p8*k(t1)^2+p9*k(t1)。end pt=y21y22。jchashu=jchashu+jch(t)*pt。end %%%%%%%求誤判次數(shù)的期望wupant=0。wupant1=0。wupan=0。 wup=zeros(1,n+1)。for t=1:n+1y21=1/9*p1*k(t)^9+1/8*p2*k(t)^8+1/7*p3*k(t)^7+1/6*p4*k(t)^6+1/5*p5*k(t)^5+1/4*p6*k(t)^4+1/3*p7*k(t)^3+1/2*p8*k(t)^2+p9*k(t)。 y31=1/10*q1*k(t)^10+1/9*q2*k(t)^9+1/8*q3*k(t)^8+1/7*q4*k(t)^7+1/6*q5*k(t)^6+1/5*q6*k(t)^5+1/4*q7*k(t)^4+1/3*q8*k(t)^3+1/2*q9*k(t)^2+q10*k(t)。 if t==1 wupan(1)=0。 elseif t=1amp。t=n1 for j=1:t1 wupant=wupant+R1^(j1)。 end wup(t)=wupant*(1R1)。 elseif t==n|t==n+1 for j=1:n1 wupant1=wupant1+R1^(j1)。 end wup(t)=wup(t)+wupant1*(1R1)。 end if t==1 y22=0。 y32=0。elsey22=1/9*p1*k(t1)^9+1/8*p2*k(t1)^8+1/7*p3*k(t1)^7+1/6*p4*k(t1)^6+1/5*p5*k(t1)^5+1/4*p6*k(t1)^4+1/3*p7*k(t1)^3+1/2*p8*k(t1)^2+p9*k(t1)。 end pt=y21y22。 wupan=wupan+wup(t)*pt。end %%%%%%換刀未壞概率y23=1/9*p1*k(n)^9+1/8*p2*k(n)^8+1/7*p3*k(n)^7+1/6*p4*k(n)^6+1/5*p5*k(n)^5+1/4*p6*k(n)^4+1/3*p7*k(n)^3+1/2*p8*k(n)^2+p9*k(n)。lasthao=R1^(n1)*(1y23)。fy=1500*wupan+10*jchashu+200*feipin+lasthao*1000+3000*(1lasthaowupan)。%目標(biāo)方程；y=fy/zhengpin。3)對function的調(diào)用clc,clear,n=10。ff=optimset。=39。off39。=1e30。=1e15。=1e20。for i=1:n A(i,i)=1。A(i,i+1)=1。endB(1)=0。B(n)=0。k0=50*ones(n+1,1)。km=50*ones(n,1)。km(n+1)=1050。kM=1050*ones(n+1,1)。Aeq=[]。Beq=[]。[k,f_opt,c,d]=fmincon(@chechuang,k0,A,B39。,Aeq,Beq,km,kM,@myfun1,ff)k=round(k)。4)運(yùn)行結(jié)果：n = 9Optimization terminated: magnitude of directional derivative in search direction less than 2* and maximum constraint violation is less than .Active inequalities (to within = 1e020): lower upper ineqlin ineqnonlin 1 k = 82 151 192 221 250 273 291 306 315 f_opt = c = 5d = iterations: 80 funcCount: 1053 stepsize: 1 algorithm: 39。mediumscale: SQP, QuasiNewton, linesearch39。 firstorderopt: cgiterations: [] message: [1x172 char]n = 10Optimization terminated: magnitude of directional derivative in search direction less than 2* and maximum constraint violation is less than .Active inequalities (to within = 1e020): lower upper ineqlin ineqnonlin 1 k =82 101 152 184 211 250 275 300 312 321f_opt = c = 1d = iterations: 36 funcCount: 444 stepsize: 1 algorithm: 39。mediumscale: SQP, QuasiNewton, linesearch39。 firstorderopt: cgiterations: [] message: [1x143 char]n = 11Optimization terminated: magnitude of directional derivative in search direction less than 2* and maximum constraint violation is less than .Active inequalities (to within = 1e020): lower upper ineqlin ineqnonlin 1 k = 112 158 193 217 245 262 283 296 318 332 341f_opt = c = 1d = iterations: 38 funcCount: 507 stepsize: 1 algorithm: 39。mediumscale: SQP, QuasiNewton, linesearch39。 firstorderopt: cgiterations: [] message: [1x143 char]問題二的擬合圖： ：28 /
教學(xué)教案相關(guān)推薦
鄂ICP備17016276號(hào)-1