Advertisements
Advertisements
प्रश्न
Choose the correct alternative:
The Penalty in VAM represents difference between the first ______
पर्याय
Two largest costs
Largest and Smallest costs
Smallest two costs
None of these
Advertisements
उत्तर
Smallest two costs
APPEARS IN
संबंधित प्रश्न
What is transportation problem?
Write mathematical form of 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 |
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
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
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
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?
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
