韩中庚版数学建模案例——玫瑰有约问题层次分析法代码
clear,clcA=[1 2 3 4 5 6 7;1/2 1 2 3 4 5 6;1/3 1/2 1 2 3 4 5;
1/4 1/3 1/2 1 2 3 4;1/5 1/4 1/3 1/2 1 2 3;1/6 1/5 1/4 1/3 1/2 1 2;
1/7 1/6 1/5 1/4 1/3 1/2 1];
=eig(A);
lamda=max(diag(d));
num=find(diag(d)==lamda);
w0=x(:,num)/sum(x(:,num))
c1=;
c2=;
c3=;
c4=;
c5=;
c6=;
c7=;
for i=1:20
for j=1:20
a1(i,j)=c1(i)/c1(j);
end
end
a1
for i=1:20
for j=1:20
a2(i,j)=c2(i)/c2(j);
end
end
a2
for i=1:20
for j=1:20
a3(i,j)=c3(i)/c3(j);
end
end
a3
for i=1:20
for j=1:20
a4(i,j)=c4(i)/c4(j);
end
end
a4
for i=1:20
for j=1:20
a5(i,j)=c5(i)/c5(j);
end
end
a5
for i=1:20
for j=1:20
a6(i,j)=c6(i)/c6(j);
end
end
a6
for i=1:20
for j=1:20
a7(i,j)=c7(i)/c7(j);
end
end
a7
=eig(a1);
lamda=max(diag(d));
num=find(diag(d)==lamda);
w(:,1)=x(:,num)/sum(x(:,num));
=eig(a2);
lamda=max(diag(d));
num=find(diag(d)==lamda);
w(:,2)=x(:,num)/sum(x(:,num));
=eig(a3);
lamda=max(diag(d));
num=find(diag(d)==lamda);
w(:,3)=x(:,num)/sum(x(:,num));
=eig(a4);
lamda=max(diag(d));
num=find(diag(d)==lamda);
w(:,4)=x(:,num)/sum(x(:,num));
=eig(a5);
lamda=max(diag(d));
num=find(diag(d)==lamda);
w(:,5)=x(:,num)/sum(x(:,num));
=eig(a6);
lamda=max(diag(d));
num=find(diag(d)==lamda);
w(:,6)=x(:,num)/sum(x(:,num));
=eig(a7);
lamda=max(diag(d));
num=find(diag(d)==lamda);
w(:,7)=x(:,num)/sum(x(:,num));
w
w1=w*w0
=sort(w1,'descend')
这个真的 太好了 顶!!!!!! 看看 非常感谢楼主的福利! 非常感谢楼主的福利! 有用,谢谢lz分享。
页:
[1]
2