cl1p.net - The internet clipboard
CL1P.NET V4. Info
Login/Sign Up
cl1p.net/transport
cl1p.net/transport
CL1P.NET V4. Info
Login/Sign Up
This cl1p will be deleted in in 24 days.
Copy
clc clear all a=[5 8 7 14] b=[7 9 18] c=[2 7 4;3 3 1;5 3 4;1 6 2] m=size(c,1) n=size(c,2) z=0; if sum(a)==sum(b) fprintf('Given problem is balanced\n'); else fprintf('Problem is unbalanced\n'); if sum(a)<sum(b) c(end+1,:)=zeros(1,length(b)) a(end+1)=sum(b)-sum(a) else c(:,end+1)=zeros(length(a),1) b(end+1)=sum(a)-sum(b) end end X=zeros(m,n) initialC=c for i=1:size(c,1) for j=1:size(c,2) cpq=min(c(:)) if cpq==Inf break end [p1,q1]=find(cpq==c) a(p1) b(q1) xpq=min(a(p1),b(q1)) X(p1,q1) [X(p1,q1),ind]=max(xpq) p=p1(ind) q=q1(ind) X(p,q)=min(a(p),b(q)) if min(a(p),b(q))==a(p) b(q)=b(q)-a(p) a(p)=a(p)-X(p,q) c(:,q)=Inf end end end for i=1:size(c,1) for j=1:size(c,2) z=z+initialC(i,j)*X(i,j) end end array2table(X) fprintf('Transportation cost is %f\n',z);