2002数学建模A题 车灯线光源的优化设计 参考答案 - 图文(10)

for k=1:29 zz=0; for nn=4:7

zz=zz+a(k,nn)*p(k,nn); end

lower_portion(k,1)=k

lower_portion(k,2)=6*10^5*p(k,1)/(1-zz); end

lower_portion %程序三（模型二的程序）

%change the a matrix's the 1,2,3 column;

%every time change the 1 column's value is change_number data1; data2; baodi; toppest;

change_number=0.01; zuiyou=zeros(29,6);

ver1=0;ver2=0;ver3=0;ver4=0; aa=a;

jianju12=10^5;jianju23=10^4; add=10;

top_portion=top_portion';

aa(:,1)=top_portion(:,1);a matrix's first column is the top_portion's the first column but not pass 1 for k=1:29

if (aa(k,1)>=1) aa(k,1)=1; end end

a(:,1)=lower_portion(:,2);%here is a matrix'first colum is %changed into the lower_portion matrix's first column a(:,2)=0;

a(:,3)=1-a(:,1)-a(:,2); a(:,4)=a(:,5); for k=1:29 ggg=Inf; cha=0;

while(a(k,1)+change_number<=aa(k,1)) a(k,1)=a(k,1)+change_number;

while(a(k,2)+change_number<=1-a(k,1)) a(k,2)=a(k,2)+change_number; a(k,3)=1-a(k,1)-a(k,2);

if(a(k,3)<0) break; else

while(a(k,4)+add<=3000) a(k,4)=a(k,4)+add;

count=p(k,4)*a(k,4)+p(k,5)*a(k,5)+p(k,6)*a(k,6)+p(k,7)*a(k,7); money1=(2*0.5-count)*a(k,1)/(p(k,1)); money2=(2*0.5-count)*a(k,2)/(p(k,2)); money3=(2*0.5-count)*a(k,3)/(p(k,3));

if (((money1-money2)<=jianju12)|((money2-money3)<=jianju23)) break; end

cha=(money1-money2)^2+(money2-money3)^2+(money3-a(k,4))^2+(a(k,4)-a(k,5))^2+(a(k,5)-a(k,6))^2+(a(k,6)-a(k,7))^2; if cha<=ggg ggg=cha;

ver1=a(k,1);ver2=a(k,2);ver3=a(k,3);ver4=a(k,4); end end end end; end;

zuiyou(k,1)=k; zuiyou(k,2)=ggg; zuiyou(k,3)=ver1; zuiyou(k,4)=ver2; zuiyou(k,5)=ver3; zuiyou(k,6)=ver4; end