Advertisements
Advertisements
प्रश्न
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 | ||
उत्तर
Total supply = 25 + 35 + 40 = 100 = `sum"a"_"i"`
Total requirement = 30 + 25 + 45 = 100 = `sum"b"_"j"`
Since `sum"a"_"i" = sum"b"_"j"`
The given transportation problem is balanced and we can find an initial basic feasible solution.
North West Corner Rule
First allocation:
| D1 | D2 | D3 | (ai) | |
| S1 | (25)9 | 8 | 5 | 25/0 |
| S2 | 6 | 8 | 4 | 35 |
| S3 | 7 | 6 | 9 | 40 |
| (bj) | 30/5 | 25 | 45 |
Second allocation:
| D1 | D2 | D3 | (ai) | |
| S2 | (5)6 | 8 | 4 | 35/30 |
| S3 | 7 | 6 | 9 | 40 |
| (bj) | 5/0 | 25 | 45 |
Third allocation:
| D2 | D3 | (ai) | |
| S2 | (25)8 | 4 | 30/5 |
| S3 | 6 | 9 | 40 |
| (bj) | 25/0 | 45 |
Fourth allocation:
| D3 | (ai) | |
| S2 | (5)4 | 5/0 |
| S3 | (40)9 | 40/0 |
| (bj) | 45/40/0 |
We first allow 5 units to cell (S2, D3).
Then balance 40 units we allot to cell (S3, D3).
The final allotment is given as follows
| D1 | D2 | D3 | Supply | |
| S1 | (25)9 | 8 | 5 | 25 |
| S2 | (5)6 | (25)8 | (5)4 | 35 |
| S3 | 7 | 6 | (40)9 | 40 |
| Requirement | 30 | 25 | 45 |
Transportation schedule:
S1 → D1
S2 → D1
S2 → D2
S2 → D3
S3 → D3
i.e x11 = 25
x21 = 5,
x22 = 25
x23 = 5
x33 = 40
Total cost is = (25 × 9) + (5 × 6) + (25 × 8) + (5 × 4) + (40 × 9)
= 225 + 30 + 200 + 20 + 360
= 835
Hence the minimum cost is ₹ 835 by NWC method.
APPEARS IN
संबंधित प्रश्न
What do you mean by balanced transportation problem?
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 |
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.
Choose the correct alternative:
In a non – degenerate solution number of allocation is
Choose the correct alternative:
In a degenerate solution number of allocations is
Choose the correct alternative:
The Penalty in VAM represents difference between the first ______
Choose the correct alternative:
Solution for transportation problem using ______ method is nearer to an optimal solution.
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?
Determine an initial basic feasible solution to the following transportation problem by using least cost method
| 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 | ||
