Advertisements
Advertisements
प्रश्न
What is the difference between Assignment Problem and Transportation Problem?
उत्तर
The assignment problem is a special case of the transportation problem.
The differences are given below:
Transportation Problem | Assignment Problem |
1. This is about reducing the cost of transportation merchandise | 1. This is about assigning finite sources to finite destinations where only one destination is allotted for one source with a minimum cost |
2. Number of sources and number of demand need not be equal | 2. Number of sources and the number of destinations must be equal |
3. If total demand and total supply are not equal then the problem is said to be unbalanced. | 3. If the number of rows is not equal to the number of columns then problems are unbalanced. |
4. It requires 2 stages to solve: Getting initial basic feasible solution, by NWC, LCM, VAM and optimal solution by MODI method | 4. It has only one stage. Hungarian method is sufficient for obtaining an optimal solution |
APPEARS IN
संबंधित प्रश्न
Solve the following minimal assignment problem :
Machines | A | B | C | D | E |
M1 | 27 | 18 | ∞ | 20 | 21 |
M2 | 31 | 24 | 21 | 12 | 17 |
M3 | 20 | 17 | 20 | ∞ | 16 |
M4 | 21 | 28 | 20 | 16 | 27 |
Solve the following minimal assignment problem and hence find minimum time where '- ' indicates that job cannot be assigned to the machine :
Machines | Processing time in hours | ||||
A | B | C | D | E | |
M1 | 9 | 11 | 15 | 10 | 11 |
M2 | 12 | 9 | - | 10 | 9 |
M3 | - | 11 | 14 | 11 | 7 |
M4 | 14 | 8 | 12 | 7 | 8 |
The assignment problem is said to be balanced if ______.
Fill in the blank :
When an assignment problem has more than one solution, then it is _______ optimal solution.
In an assignment problem, if number of column is greater than number of rows, then a dummy column is added.
Solve the following problem :
A plant manager has four subordinates, and four tasks to be performed. The subordinates differ in efficiency and the tasks differ in their intrinsic difficulty. This estimate of the time each man would take to perform each task is given in the effectiveness matrix below.
I | II | III | IV | |
A | 7 | 25 | 26 | 10 |
B | 12 | 27 | 3 | 25 |
C | 37 | 18 | 17 | 14 |
D | 18 | 25 | 23 | 9 |
How should the tasks be allocated, one to a man, as to minimize the total man hours?
Give mathematical form of Assignment problem
Choose the correct alternative:
Number of basic allocation in any row or column in an assignment problem can be
Choose the correct alternative:
The solution for an assignment problem is optimal if
A dairy plant has five milk tankers, I, II, III, IV and V. Three milk tankers are to be used on five delivery routes A, B, C, D and E. The distances (in kms) between the dairy plant and the delivery routes are given in the following distance matrix.
I | II | III | IV | V | |
A | 150 | 120 | 175 | 180 | 200 |
B | 125 | 110 | 120 | 150 | 165 |
C | 130 | 100 | 145 | 160 | 170 |
D | 40 | 40 | 70 | 70 | 100 |
E | 45 | 25 | 60 | 70 | 95 |
How should the milk tankers be assigned to the chilling center so as to minimize the distance travelled?