Advertisements
Advertisements
Question
Determine basic feasible solution to the following transportation problem using North west Corner rule.
| Sinks | |||||||
| A | B | C | D | E | Supply | ||
| P | 2 | 11 | 10 | 3 | 7 | 4 | |
| Origins | Q | 1 | 4 | 7 | 2 | 1 | 8 |
| R | 3 | 9 | 4 | 8 | 12 | 9 | |
| Demand | 3 | 3 | 4 | 5 | 6 | ||
Advertisements
Solution
For the given problem, total supply is 4 + 8 + 9 = 21 and total demand is 3 + 3 + 4 + 5 + 6 = 21.
Since the total supply equals total demand, it is a balanced problem and we can find a feasible solution by the North West Comer rule.
First allocation:
| A | B | C | D | E | (ai) | |
| P | (3)2 | 11 | 10 | 3 | 7 | 4/1 |
| Q | 1 | 4 | 7 | 2 | 1 | 8 |
| R | 3 | 9 | 4 | 8 | 12 | 9 |
| (bj) | 3/0 | 3 | 4 | 5 | 6 |
Second allocation:
| B | C | D | E | (ai) | |
| P | (1)11 | 10 | 3 | 7 | 1/0 |
| Q | 4 | 7 | 2 | 1 | 8 |
| R | 9 | 4 | 8 | 12 | 9 |
| (bj) | 3/2 | 4 | 5 | 6 |
Third allocation:
| B | C | D | E | (ai) | |
| Q | (2)4 | 7 | 2 | 1 | 8/6 |
| R | 9 | 4 | 8 | 12 | 9 |
| (bj) | 2/0 | 4 | 5 | 6 |
Fourth allocation:
| C | D | E | (ai) | |
| Q | (4)7 | 2 | 1 | 6/2 |
| R | 4 | 8 | 12 | 9 |
| (bj) | 4/0 | 5 | 6 |
Fifth allocation:
| D | E | (ai) | |
| Q | (2)2 | 1 | 2/0 |
| R | 8 | 12 | 9 |
| (bj) | 5/3 | 6 |
Final allocation:
| D | E | (ai) | |
| R | (3)8 | (6)12 | 9/6/0 |
| (bj) | 3/0 | 6/0 |
First, we allow 3 units to (R, D) cell.
Then balance 6 to (R, E) cell.
Thus we have the following allocations:
| A | B | C | D | E | Supply | |
| P | (3)2 | (1)11 | 10 | 3 | 7 | 4/1 |
| Q | 1 | (2)4 | (4)7 | (2)2 | 1 | 8 |
| R | 3 | 9 | 4 | (3)8 | (6)12 | 9 |
| Demand | 3 | 3 | 4 | 5 | 6 |
Transportation schedule:
P → A
P → B
Q → B
Q → C
Q → D
R → D
R → E
i.e x11 = 3
x12 = 1
x22 = 2
x23 = 4
x24 = 2
x34 = 3
x35 = 6
Total cost = (3 × 2) + (1 × 11) + (2 × 4) + (4 × 7) + (2 × 2) + (3 × 8) + (6 × 12)
= 6 + 11 + 8 + 28 + 4 + 24 + 72
= 153
Thus the minimum cost of the transportation problem by Northwest Comer rule is ₹ 153.
APPEARS IN
RELATED QUESTIONS
What is transportation problem?
Write mathematical form of transportation problem
Find an initial basic feasible solution of the following problem using the northwest corner rule.
| D1 | D2 | D3 | D4 | Supply | |
| O1 | 5 | 3 | 6 | 2 | 19 |
| O2 | 4 | 7 | 9 | 1 | 37 |
| O3 | 3 | 4 | 7 | 5 | 34 |
| Demand | 16 | 18 | 31 | 25 |
Determine an initial basic feasible solution of the following transportation problem by north west corner method.
| Bangalore | Nasik | Bhopal | Delhi | Capacity | |
| Chennai | 6 | 8 | 8 | 5 | 30 |
| Madurai | 5 | 11 | 9 | 7 | 40 |
| Trickly | 8 | 9 | 7 | 13 | 50 |
| Demand (Units/day) |
35 | 28 | 32 | 25 |
Obtain an initial basic feasible solution to the following transportation problem by using least-cost method.
| D1 | D2 | D3 | Supply | |
| O1 | 9 | 8 | 5 | 25 |
| O2 | 6 | 8 | 4 | 35 |
| O3 | 7 | 6 | 9 | 40 |
| Demand | 30 | 25 | 45 |
Find the initial basic feasible solution of the following transportation problem:
| I | II | III | Demand | |
| A | 1 | 2 | 6 | 7 |
| B | 0 | 4 | 2 | 12 |
| C | 3 | 1 | 5 | 11 |
| Supply | 10 | 10 | 10 |
Using North West Corner rule
Find the initial basic feasible solution of the following transportation problem:
| I | II | III | Demand | |
| A | 1 | 2 | 6 | 7 |
| B | 0 | 4 | 2 | 12 |
| C | 3 | 1 | 5 | 11 |
| Supply | 10 | 10 | 10 |
Using Vogel’s approximation method
Choose the correct alternative:
In a non – degenerate solution number of allocation is
Choose the correct alternative:
The Penalty in VAM represents difference between the first ______
Consider the following transportation problem
| Detination | Availabiity | ||||
| D1 | D2 | D3 | D4 | ||
| O1 | 5 | 8 | 3 | 6 | 30 |
| O2 | 4 | 5 | 7 | 4 | 50 |
| O3 | 6 | 2 | 4 | 6 | 20 |
| Requirement | 30 | 40 | 20 | 10 | |
Determine an initial basic feasible solution using Least cost method
