danchunxingbiaogefa.rar_单纯形表格法_线性规划

function simplexTab(mat,numFreeVar) %输入： %mat 单纯形表 %numFreeVar 自由变量个数 format short %检验和寻找最佳判别数 %maxRow，maxCol 单纯形表的行数和列数 maxRow=length(mat(:,1)); maxCol=length(mat(1,:)); %判别数 objEntryExcludingMaxPayOff=mat(maxRow,1:maxCol-2); %寻找最小判别数 [objEnt bestColToPivot]=min(objEntryExcludingMaxPayOff); % % %循环迭代 while objEnt<0 %出基可行解列 lastColExcludingObjEntry=mat(1:(maxRow-1),maxCol); %入基可行解列 ithColExcludingObjEntry=mat(1:(maxRow-1),bestColToPivot); %找出最小正比数及其对应的行 a= lastColExcludingObjEntry./ithColExcludingObjEntry; [val bestRowToPivot]=min(a); sprintf('the best Pivot is % d row and % d col',bestRowToPivot,bestColToPivot) disp('the simplex table is'); [mat,[a;0]] disp('press any key to continue'); pause; if val<0 [s indices]=sort(a); if max(a)>0 count=1; while s(count)<0 count=count+1; end bestRowToPivot=indices(count); end end if length(a)==0 length(a) return end %旋转变换 mat=pivot(mat,bestRowToPivot,bestColToPivot); %寻找最小判别数 objEntryExcludingMaxPayOff=mat(maxRow,1:maxCol-2); [objEnt bestColToPivot]=min(objEntryExcludingMaxPayOff); %当所有的判别数都大于0的时候迭代停止 end % % sprintf('the best Pivotis % d row and % d col',bestRowToPivot,bestColToPivot) disp('the simplex table is'); [mat,[a;0]] disp('It is the end!');