Advertisements
Advertisements
प्रश्न
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
उत्तर
Total demand (ai) = 7 + 12 + 11 = 30 and total supply (bj) = 10 + 10 + 10 = 30.
`sum"a"_"i" = sum"b"_"j"` = Σbj ⇒ the problem is a balanced transportation problem and we can find a basic feasible solution.
North West Comer rule (NWC)
First allocation:
I | II | III | (ai) | |
A | (7)1 | 2 | 6 | 7/0 |
B | 0 | 4 | 2 | 12 |
C | 3 | 1 | 5 | 11 |
(bj) | 10/3 | 10 | 10 |
Second allocation:
I | II | III | (ai) | |
B | (3)0 | 4 | 2 | 12/9 |
C | 3 | 1 | 5 | 11 |
(bj) | 3/0 | 10 | 10 |
Third allocation:
II | III | (ai) | |
B | (9)4 | 2 | 9/0 |
C | 1 | 5 | 11 |
(bj) | 10/1 | 10 |
Fourth allocation:
II | III | (ai) | |
C | (1)1 | (10)5 | 11/10/0 |
(bj) | 10/1 | 10/0 |
We first allot 1 unit to (C, II) cell and then the balance 10 units to (C, III) cell.
Thus we have the following allocations:
I | II | III | Demand | |
A | (7)1 | 2 | 6 | 7 |
B | (3)0 | (9)4 | 2 | 12 |
C | 3 | (1)1 | (10)5 | 11 |
Supply | 10/3 | 10 | 10 |
Transportation schedule:
A → I
B → I
B → II
C → II
C → III
i.e x11 = 7
x21 = 3
x22 = 9
x32 = 1
x33 = 10
Total cost = (7 × 1) + (3 × 0) + (9 × 4) + (1 × 1) + (10 × 5)
= 7 + 0 + 36 + 1 + 50
= ₹ 94
APPEARS IN
संबंधित प्रश्न
What is transportation problem?
Write mathematical form of transportation problem
What is feasible solution and non degenerate solution in 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 |
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 Least Cost method
Obtain an initial basic feasible solution to the following transportation problem by north west corner method.
D | E | F | C | Available | |
A | 11 | 13 | 17 | 14 | 250 |
B | 16 | 18 | 14 | 10 | 300 |
C | 21 | 24 | 13 | 10 | 400 |
Required | 200 | 225 | 275 | 250 |
Choose the correct alternative:
In a non – degenerate solution number of allocation is
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
Consider the following transportation problem
Destination | Availability | ||||
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 Vogel’s approximation method
Determine an initial basic feasible solution to the following transportation problem by using north west corner rule
Destination | Supply | ||||
D1 | D2 | D3 | |||
S1 | 9 | 8 | 5 | 25 | |
Source | S2 | 6 | 8 | 4 | 35 |
S3 | 7 | 6 | 9 | 40 | |
Requirement | 30 | 25 | 45 |