Advertisements
Advertisements
प्रश्न
Choose the correct alternative:
Solution for transportation problem using ______ method is nearer to an optimal solution.
विकल्प
NWCM
LCM
VAM
Row Minima
उत्तर
VAM
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 |
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 |
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.
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 degenerate solution number of allocations 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
Explain Vogel’s approximation method by obtaining initial basic feasible solution of the following transportation problem.
Destination | ||||||
D1 | D2 | D3 | D4 | Supply | ||
O1 | 2 | 3 | 11 | 7 | 6 | |
Origin | O2 | 1 | 0 | 6 | 1 | 1 |
O3 | 5 | 8 | 15 | 9 | 10 | |
Demand | 7 | 5 | 3 | 2 |