You are on page 1of 1

Hard Copy Assignment-2 (Transportation Problem)

ME 4237: Decision Modelling, BTech, ME, Autumn, 2020-21 by Prof. SK Patel

All the following assignments are to be solved in the class note and shown in next class

Q Questions
1 An industry has three factories and four warehouses. The production capacity of
three factories F1, F2 and F3 are 15, 25 and 20 respectively. The requirements of
four warehouses W1, W2, W3 and W4 are 10, 10, 15 and 25 respectively. The cost
of transporting one item (in Rs/unit) from factory F1 to four warehouses are 12, 4,
24 and 15 respectively. Similar costs from factory F2 are 14, 8, 10 and 22, and from
factory F3 are 6, 16, 18 and 20 respectively. Decide the most economic shipping
schedule. Formulate it as a transportation model.
2 Solve Q.1 using north-west corner method. Ans: Rs. 840
3 Solve Q.1 using south-east corner method. Ans: Rs. 840
4 Solve Q.1 using south-west corner method. Ans: Rs. 815
5 Solve Q.1 using north-east corner method. Ans: Rs. 815
6 Solve Q.1 using least cost method. Ans: Rs. 745
7 Solve Q.1 using Vogel Approximation method. Ans: Rs. 745
8 Optimize the solution obtained in Q.2. Ans: Rs. 840, 800, 745, 715
9 Refer Q.1. What will be the solution using least cost method if demand of
warehouse W2 is 20 instead of 10. Ans: Rs. 760
10 Refer Q.1. What will be the solution using least cost method if supply of factory
F3 is 30 instead of 20. Ans: Rs. 780
11 Solve Q1 by least cost method if all the unit cost figures represent unit profits. Ans:
Rs. 1230
12 Solve Q1 by least cost method if the lowest cost 4 is replaced by a very high
positive cost M. Ans: Rs. 715
13 Two plants P1 and P2 sends toys to three dealers D1, D2 and D3 through two transit
centres T1 and T2 as per network shown below. The supply capacities of plants P1
and P2 are 1000 and 1200 toys respectively and the demand of dealers D1, D2 and
D3 are 800, 900 and 500 toys respectively. The shipping costs in Rs. per unit
between all feasible pairs of nodes are tabulated below. Provide a shipping schedule
as per least cost method. Ans: 20700
P1 P2 T1 T2 D1 D2 D3
P1 3 4
P2 2 5
T1 7 8 6
T2 4 9
D1 5
D2 3
D3

Dr. S.K. Patel, Mech Engg, NIT Rourkela 29-Aug-19 Page 1 of 1

You might also like