clc;clear;disp(' X1 X2 X3 X4 X5 X6 X7 X8 X9 B ');

A=[];

m=7;n=9;disp(A);it=1; while min(A(m,:))<0

fprintf('ITERACIÓN %1d',it);disp(' ');

c=min(A(m,:));i=find(A(m,:)==c);fprintf(' ---> Ingresa X%2d',i);

for k=1:m-1

q(k)=A(k,n+1)/A(k,i);

end

q1=q(q>0);f=min(q1);s=find(q==f);fprintf(' ---> Pibot Fila %2d',s);disp(' ');

A(s,:)=A(s,:)/A(s,i); for j=1:m

if j~=s

A(j,:)=A(j,:)-A(s,:)*A(j,i);

end

end

• disp(A);it=it+1;

• end

• fprintf('SOLUCIÓN ÓPTIMA =');OP=A(:,n+1);disp(OP');