Vogel approximation method (VAM) in transportation problem

//Vogel approximation method (VAM) in transportation problem #include<stdio.h> main() { int res,des,*s,*d,**cell,**cost,i,j,r1,c1,r2,c2,p,q,a1,a2,max1,max2,min1,min2,sumreq=0,count=0,sumdes=0,total=0,*rowpanl,*colpanl; printf("Enter number of resources: "); scanf("%d",&res); printf("Enter the number of destinations: "); scanf("%d",&des); //memory allocation s=(int *)malloc(res*sizeof(int)); rowpanl=(int *)malloc(res*sizeof(int)); d=(int...

Read More

Tweet

North West Corner Method in transportation problem

//North West Corner Method in transportation problem #include<stdio.h> main() { int res,des,*s,*d,**cell,**cost,i,j,sumreq=0,sumdes=0,c=0,total=0; printf("Enter number of resources: "); scanf("%d",&res); printf("Enter the number of destinations: "); scanf("%d",&des); //memory allocation s=(int *)malloc(res*sizeof(int)); d=(int *)malloc(des*sizeof(int)); cell=(int **)malloc(res*sizeof(int *)); for(i=0;i<res;i++) cell[i]=(int...

Read More

Tweet

Least Cost Entry Method in Transportation Problem

 //Least Cost Entry Method in Transportation Problem #include<stdio.h> main() { int res,des,*s,*d,**cell,**cost,i,j,p,q,t1,t2,min,sumreq=0,sumdes=0,count=0,total=0; printf("Enter number of resources: "); scanf("%d",&res); printf("Enter the number of destinations: "); scanf("%d",&des); //memory allocation s=(int *)malloc(res*sizeof(int)); d=(int *)malloc(des*sizeof(int)); cell=(int **)malloc(res*sizeof(int *)); for(i=0;i<res;i++) cell[i]=(int...

Read More

Tweet