0
6.1kviews
Find the optimal transportation plan for the following transportation problem:
  1 2 3 4 5 Available
A 7 6 4 5 9 40
B 8 5 6 7 8 30
C 6 8 9 6 5 20
D 5 7 7 8 6 10
Required 30 30 15 20 5 100 (total)
1 Answer
1
383views

(NOTE: This problem is exactly the same as the previous one, except that in the May 13 paper, it was asked to find the basic feasible solution by north-west rule. Here, we’ll do so by using Vogel’s approximation, also called the Penalty method, which leads to a final optimal solution …

Create a free account to keep reading this post.

and 5 others joined a min ago.

Please log in to add an answer.