Advertisements
Advertisements
Question
Choose the correct alternative:
Number of basic allocation in any row or column in an assignment problem can be
Options
exactly one
at least one
at most one
none of these
Solution
exactly one
APPEARS IN
RELATED QUESTIONS
Solve the following maximal assignment problem :
Branch Manager | Monthly Business ( Rs. lakh) | |||
A | B | C | D | |
P | 11 | 11 | 9 | 9 |
Q | 13 | 16 | 11 | 10 |
R | 12 | 17 | 13 | 8 |
S | 16 | 14 | 16 | 12 |
A departmental head has three jobs and four subordinates. The subordinates differ in their capabilities and the jobs differ in their work
contents. With the help of the performance matrix given below, find out which of the four subordinates should be assigned which jobs ?
Subordinates | Jobs | ||
I | II | III | |
A | 7 | 3 | 5 |
B | 2 | 7 | 4 |
C | 6 | 5 | 3 |
D | 3 | 4 | 7 |
A job production unit has four jobs A, B, C, D which can be manufactured on each of the four machines P, Q, R and S. The processing cost of each job for each machine is given in the following table:
Jobs | Machines (Processing Cost in ₹) |
|||
P | Q | R | S | |
A | 31 | 25 | 33 | 29 |
B | 25 | 24 | 23 | 21 |
C | 19 | 21 | 23 | 24 |
D | 38 | 36 | 34 | 40 |
Find the optimal assignment to minimize the total processing cost.
Five wagons are available at stations 1, 2, 3, 4, and 5. These are required at 5 stations I, II, III, IV, and V. The mileage between various stations are given in the table below. How should the wagons be transported so as to minimize the mileage covered?
I | II | III | IV | V | |
1 | 10 | 5 | 9 | 18 | 11 |
2 | 13 | 9 | 6 | 12 | 14 |
3 | 3 | 2 | 4 | 4 | 5 |
4 | 18 | 9 | 12 | 17 | 15 |
5 | 11 | 6 | 14 | 19 | 10 |
The assignment problem is said to be unbalance if ______
If the given matrix is ______ matrix, the assignment problem is called balanced problem
What is the difference between Assignment Problem and Transportation Problem?
Choose the correct alternative:
If number of sources is not equal to number of destinations, the assignment problem is called ______
Choose the correct alternative:
The solution for an assignment problem is optimal if
A plant manager has four subordinates and four tasks to perform. The subordinates differ in efficiency and task differ in their intrinsic difficulty. Estimates of the time subordinate would take to perform tasks are given in the following table:
I | II | III | IV | |
A | 3 | 11 | 10 | 8 |
B | 13 | 2 | 12 | 2 |
C | 3 | 4 | 6 | 1 |
D | 4 | 15 | 4 | 9 |
Complete the following activity to allocate tasks to subordinates to minimize total time.
Solution:
Step I: Subtract the smallest element of each row from every element of that row:
I | II | III | IV | |
A | 0 | 8 | 7 | 5 |
B | 11 | 0 | 10 | 0 |
C | 2 | 3 | 5 | 0 |
D | 0 | 11 | 0 | 5 |
Step II: Since all column minimums are zero, no need to subtract anything from columns.
Step III: Draw the minimum number of lines to cover all zeros.
I | II | III | IV | |
A | 0 | 8 | 7 | 5 |
B | 11 | 0 | 10 | 0 |
C | 2 | 3 | 5 | 0 |
D | 0 | 11 | 0 | 5 |
Since minimum number of lines = order of matrix, optimal solution has been reached
Optimal assignment is A →`square` B →`square`
C →IV D →`square`
Total minimum time = `square` hours.