Program:
class north
{
public:
int c[10][10],s1[10],d1[10],s[10],d[10];
int m,n,i,j,sum1,sum2;
void getdata();
void cal();
};
void north::getdata(void)
{
//input for dimensions
cout<<"enter number of row (m) : - ";
cin>>m;
cout<<"enter number of column (n) : - ";
cin>>n;
//input for cost matrix
cout<<endl<<"ENTER THE COST MATRIX"<<endl;
for(i=0;i<m;i++)
{
for(j=0;j<n;j++)
{
cout<<endl<<"enter element of row ";
cout<<i+1<<" and column "<<j+1<<" : - ";
cin>>c[i][j];
}
}
//input for supply
cout<<endl<<"ENTER THE SUPPLY ARRAY"<<endl;
int sum1=0;
for(j=0;j<m;j++)
{
cin>>s[j];
s1[j]=s[j];
sum1=sum1+s1[j];
}
cout<<"suplay=>"<<sum1;
//input for demand
cout<<endl<<"ENTER THE DEMAND ARRAY"<<endl;
int sum2=0;
for(j=0;j<n;j++)
{
cin>>d[j];
d1[j]=d[j];
sum2=sum2+d1[j];
}
cout<<"demand=>"<<sum2;
}
void north::cal(void)
{
nn: if(sum1!=sum2)
{
cout<<"
problem is unbalanced";
exit;
}
// exit;
i=0;j=0;
int sum=0;
start: if(i==m&&j==n)
goto end;
else if (s[i]==d[j])
{
sum=sum+(c[i][j]*s[i]);
i++;j++;
}
else if(s[i]<d[j])
{
d[j]=d[j]-s[i];
sum=sum+(c[i][j]*s[i]);
i++;
}
else if(s[i]>d[j])
{
s[i]=s[i]-d[j];
sum=sum+(c[i][j]*d[j]);
j++;
}
goto start;
end:
clrscr();
cout<<endl<<"-------------- ---------------------------------"<<endl;
cout<<"| |"<<endl;
for(i=0;i<m;i++)
{
cout<<"| ";
for(j=0;j<n;j++)
{
cout<<c[i][j]<<" ";
}
cout<<"| "<<s1[i]<<endl<<"| |";
cout<<endl<<"| |"<<endl;
}
cout<<" ------------------------------------------------"<<endl<<endl;
for(i=0;i<n;i++)
{
cout<<" "<<d1[i];
}
cout<<"
THE MINIMUM TRANSPORTATION COST = "<<sum<<" units";
}
void main()
{
clrscr();
north n;
n.getdata();
n.cal();
getch();
}
/* OUTPUT:
enter number of row (m) : - 3
enter number of column (n) : - 3
ENTER THE COST MATRIX
enter element of row 1 and column 1 : - 1
enter element of row 1 and column 2 : - 2
enter element of row 1 and column 3 : - 3
enter element of row 2 and column 1 : - 4
enter element of row 2 and column 2 : - 5
enter element of row 2 and column 3 : - 6
enter element of row 3 and column 1 : - 7
enter element of row 3 and column 2 : - 8
enter element of row 3 and column 3 : - 9
ENTER THE SUPPLY ARRAY
11
22
33
suplay=>66
ENTER THE DEMAND ARRAY
11
22
33
-------------- ---------------------------------
|
| 1 2 3 | 11
| |
| |
| 4 5 6 | 22
| |
| |
| 7 8 9 | 33
| |
| |
------------------------------------------------
11 22 33
THE MINIMUM TRANSPORTATION COST = 418 units
*/