Advertisements
Advertisements
प्रश्न
State whether the following statement is True or False:
To convert the assignment problem into maximization problem, the smallest element in the matrix is to deducted from all other elements
विकल्प
True
False
उत्तर
False
APPEARS IN
संबंधित प्रश्न
Four new machines M1, M2, M3 and M4 are to be installed in a machine shop. There are five vacant places A, B, C, D and E available. Because of limited space, machine M2 cannot be placed at C and M3 cannot be placed at A. The cost matrix is given below.
| Machines | Places | ||||
| A | B | C | D | E | |
| M1 | 4 | 6 | 10 | 5 | 6 |
| M2 | 7 | 4 | – | 5 | 4 |
| M3 | – | 6 | 9 | 6 | 2 |
| M4 | 9 | 3 | 7 | 2 | 3 |
Find the optimal assignment schedule
Fill in the blank :
When the number of rows is equal to the number of columns then the problem is said to be _______ assignment problem.
Fill in the blank :
If the given matrix is not a _______ matrix, the assignment problem is called an unbalanced problem.
Fill in the blank :
A dummy row(s) or column(s) with the cost elements as _______ is added to the matrix of an unbalanced assignment problem to convert into a square matrix.
Maximization assignment problem is transformed to minimization problem by subtracting each entry in the table from the _______ value in the table.
Fill in the blank :
In maximization type, all the elements in the matrix are subtracted from the _______ element in the matrix.
To convert the assignment problem into a maximization problem, the smallest element in the matrix is deducted from all other elements.
State whether the following is True or False :
The purpose of dummy row or column in an assignment problem is to obtain balance between total number of activities and total number of resources.
State whether the following is True or False
In number of lines (horizontal on vertical) > order of matrix then we get optimal solution.
Solve the following problem :
Solve the following assignment problem to maximize sales:
| Salesman | Territories | ||||
| I | II | III | IV | V | |
| A | 11 | 16 | 18 | 15 | 15 |
| B | 7 | 19 | 11 | 13 | 17 |
| C | 9 | 6 | 14 | 14 | 7 |
| D | 13 | 12 | 17 | 11 | 13 |
Solve the following problem :
The estimated sales (tons) per month in four different cities by five different managers are given below:
| Manager | Cities | |||
| P | Q | R | S | |
| I | 34 | 36 | 33 | 35 |
| II | 33 | 35 | 31 | 33 |
| III | 37 | 39 | 35 | 35 |
| IV | 36 | 36 | 34 | 34 |
| V | 35 | 36 | 35 | 33 |
Find out the assignment of managers to cities in order to maximize sales.
An unbalanced assignment problems can be balanced by adding dummy rows or columns with ______ cost
A ______ assignment problem does not allow some worker(s) to be assign to some job(s)
Find the assignments of salesman to various district which will yield maximum profit
| Salesman | District | |||
| 1 | 2 | 3 | 4 | |
| A | 16 | 10 | 12 | 11 |
| B | 12 | 13 | 15 | 15 |
| C | 15 | 15 | 11 | 14 |
| D | 13 | 14 | 14 | 15 |
State whether the following statement is true or false:
To convert a maximization-type assignment problem into a minimization problem, the smallest element in the matrix is deducted from all elements of the matrix.
Three new machines M1, M2, M3 are to be installed in a machine shop. There are four vacant places A, B, C, D. Due to limited space, machine M2 can not be placed at B. The cost matrix (in hundred rupees) is as follows:
| Machines | Places | |||
| A | B | C | D | |
| M1 | 13 | 10 | 12 | 11 |
| M2 | 15 | - | 13 | 20 |
| M3 | 5 | 7 | 10 | 6 |
Determine the optimum assignment schedule and find the minimum cost.
