Assign four trucks 1, 2, 3 and 4 to vacant spaces A, B, C, D, E and F so that distance travelled is minimized. The matrix below shows the distance.

Determine an initial basic feasible solution to the following transportation problem by using North West Corner rule 

Explain Vogel’s approximation method by obtaining initial feasible solution of the following transportation problem.

A car hire company has one car at each of five depots a,b,c,d and e. A customer in each of the fine towers A,B,C,D and E requires a car. The distance (in miles) between the depots (origins) and the towers(destinations) where the customers are given in the following distance matrix.

How should the cars be assigned to the customers so as to minimize the distance travelled?

A natural truck-rental service has a surplus of one truck in each of the cities 1,2,3,4,5 and 6 and a deficit of one truck in each of the cities 7,8,9,10,11 and 12. The distance(in kilometers) between the cities with a surplus and the cities with a deficit are displayed below:

How should the truck be dispersed so as to minimize the total distance travelled?