Advertisements
Advertisements
Question
The following table summarizes the supply, demand and cost information for four factors S1, S2, S3, S4 Shipping goods to three warehouses D1, D2, D3.
D1 | D2 | D3 | Supply | |
S1 | 2 | 7 | 14 | 5 |
S2 | 3 | 3 | 1 | 8 |
S3 | 5 | 4 | 7 | 7 |
S4 | 1 | 6 | 2 | 14 |
Demand | 7 | 9 | 18 |
Find an initial solution by using north west corner rule. What is the total cost for this solution?
Solution
Let ‘ai‘ denote the supply and ‘bj‘ denote the demand.
Then total supply = 5 + 8 + 7 + 14 = 34 and Total demand = 7 + 9 + 18 = 34
`sum"a"_"j" = sum"b"_"j"`.
So the problem is a balanced transportation problem and we can find a basic feasible solution, by North-west comer rule.
First allocation:
D1 | D2 | D3 | Supply (aj) |
|
S1 | (5)2 | 7 | 14 | 5/0 |
S2 | 3 | 3 | 1 | 8 |
S3 | 5 | 4 | 7 | 7 |
S4 | 1 | 6 | 2 | 14 |
Demand (bj) |
7/2 | 9 | 18 |
Second allocation:
D1 | D2 | D3 | (aj) | |
S2 | (2)3 | 3 | 1 | 8/6 |
S3 | 5 | 4 | 7 | 7 |
S4 | 1 | 6 | 2 | 14 |
(bj) | 2/0 | 9 | 18 |
Third allocation:
D2 | D3 | (aj) | |
S2 | (6)3 | 1 | 6/0 |
S3 | 4 | 7 | 7 |
S4 | 6 | 2 | 14 |
(bj) | 9/3 | 18 |
Fourth allocation:
D2 | D3 | (aj) | |
S2 | (3)4 | 7 | 7/4 |
S4 | 6 | 2 | 14 |
(bj) | 3/0 | 18 |
Fifth allocation:
D3 | (aj) | |
S2 | (4)7 | 4/0 |
S4 | (14)2 | 14/0 |
(bj) | 18/14/0 |
We first allow 4 units to cell (S3, D3) and then the balance 14 units to cell (S4, D3).
Thus we get the following allocations:
D1 | D2 | D3 | Supply | |
S1 | (5)2 | 7 | 14 | 5 |
S2 | (2)3 | (6)3 | 1 | 8 |
S3 | 5 | (3)4 | (4)7 | 7 |
S4 | 1 | 6 | (14)2 | 14 |
Demand | 7 | 9 | 18 |
The transportation schedule:
S1 → D1
S2 → D1
S2 → D2
S3 → D2
S3 → D3
S4 → D3
i.e x11 = 5
x21 = 2
x22 = 6
x32 = 3
x33 = 4
x43 = 14
Total cost = (5 × 2) + (2 × 3) + (6 × 3) + (3 × 4) + (4 × 7) + (14 × 2)
= 10 + 6+ 18 + 12 + 28 + 28
= 102
Thus the initial basic solution is got by NWC method and minimum cost is ₹ 102.
APPEARS IN
RELATED QUESTIONS
What is transportation problem?
What do you mean by balanced transportation problem?
Explain Vogel’s approximation method by obtaining initial feasible solution of the following transportation problem.
D1 | D2 | D3 | D4 | Supply | |
O1 | 2 | 3 | 11 | 7 | 6 |
O2 | 1 | 0 | 6 | 1 | 1 |
O3 | 5 | 8 | 15 | 9 | 10 |
Demand | 7 | 5 | 3 | 2 |
Consider the following transportation problem.
D1 | D2 | D3 | D4 | Availability | |
O1 | 5 | 8 | 3 | 6 | 30 |
O2 | 4 | 5 | 7 | 4 | 50 |
O3 | 6 | 2 | 4 | 6 | 20 |
Requirement | 30 | 40 | 20 | 10 |
Determine initial basic feasible solution by VAM.
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 |
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
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:
The transportation problem is said to be unbalanced if ______
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