work3.m

matlab改进的网格算法

clear;
num=0.01;
count=0;
A=[-1  0];
B=[5  10];
dbl=B-A;
while (min(dbl)>num)
    count=count+1;
    
m=8;                                       %在网格上均匀设计方法产生m个均匀分布的点
h=[1 2];
for i=1:m-1                                      
    for j=1:2
        u(1,j)=h(j);
        if ((u(i,j)+h(j))<=m)
            u(i+1,j)=u(i,j)+h(j);
        else
            u(i+1,j)=u(i,j)+h(j)-m;
        end
    end
end
dbl=B-A;
for i=1:m
    for j=1:2
        x(i,j)=A(j)+(u(i,j)-1)*dbl(j)/(m-1);
    end
end

plot(x(:,1),x(:,2),'r.');grid on;hold on;
minret=1;
ret=work31(x);
for i=1:m                                   %排序，找出最小值点
    if ((i>=2) & (ret(i)<ret(i-1)))
         minret=i;
    end
end


xx=[x(minret,1) x(minret,2)];
dbl=dbl*0.8;
a1=xx(1)-0.5*dbl(1);
a2=xx(2)-0.5*dbl(2);
b1=xx(1)+0.5*dbl(1);
b2=xx(2)+0.5*dbl(2);

if (a1<-1)        %越界检查
  a1=-1;
end
if (a2<0)
  a2=0;
end
if (b1>5)
  b1=5;
end
if (b2>10)
  b2=10;
end

A=[a1 a2];
B=[b1 b2];
rect=[a1 a2
      a1 b2
      b1 b2
      b1 a2
      a1 a2];
plot(xx(1),xx(2),'b*')      


plot(rect(:,1),rect(:,2),'r');pause(0.5)

end
count;
xx;
fresult=work31(xx);
msgbox({['最优点函数值：' num2str(fresult)]; ['对应坐标为：' num2str(xx)]; ['程序循环计算次数：' int2str(count)]});