Advertisements
Advertisements
प्रश्न
To use the Hungarian method, a profit maximization assignment problem requires ______.
विकल्प
Converting all profits to opportunity losses
A dummy person or job
Matrix expansion
Finding the maximum number of lines to cover all the zeros in the reduced matrix
उत्तर
To use the Hungarian method, a profit maximization assignment problem requires converting all profits to opportunity losses.
संबंधित प्रश्न
The Assignment Problem is solved by ______.
Choose the correct alternative :
Using Hungarian method the optimal assignment obtained for the following assignment problem to minimize the total cost is:
| Agent | Job | |||
| A | B | C | D | |
| 1 | 10 | 12 | 15 | 25 |
| 2 | 14 | 11 | 19 | 32 |
| 3 | 18 | 21 | 23 | 29 |
| 4 | 15 | 20 | 26 | 28 |
Fill in the blank :
For solving an assignment problem the matrix should be a _______ matrix.
Fill in the blank :
In Hungarian Method, only _______ task can be assigned to each facility.
State whether the following is True or False :
The Hungarian method operates on the principle of matrix reduction, whereby the cost table is reduced to a set of opportunity costs.
State whether the following is True or False :
Optimal assignments are made in the Hungarian method to cells in the reduced matrix that contain a zero.
State whether the following is True or False :
Using the Hungarian method, the optimal solution to an assignment problem is found when the minimum number of lines required to cover the zero cells in the reduced matrix equals the no of persons.
Choose the correct alternative:
The assignment problem is solved by ______
The Hungarian method is an ______ algorithm that solves an assignment problem
State whether the following statement is True or False:
Optimal assignments are made in the Hungarian method to cells in the reduced matrix that contain a zero
State whether the following statement is True or False:
The Hungarian method is used to assign n jobs on 2 machines to get the optimal sequence
