Advertisements
Advertisements
Question
Fill in the blank :
In maximization type, all the elements in the matrix are subtracted from the _______ element in the matrix.
Solution
In maximization type, all the elements in the matrix are subtracted from the largest element in the matrix.
APPEARS IN
RELATED QUESTIONS
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
A company has a team of four salesmen and there are four districts where the company wants to start its business. After taking into account the capabilities of salesmen and the nature of districts, the company estimates that the profit per day in rupees for each salesman in each district is as below:
| 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 |
Find the assignment of salesman to various districts which will yield maximum profit.
In the modification of a plant layout of a factory 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 of locating a machine at a place (in hundred rupees) is as follows.
| Machines | Location | ||||
| 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 |
Find the optimal assignment schedule.
Fill in the blank :
An assignment problem is said to be unbalanced when _______.
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.
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 |
Choose the correct alternative:
The cost matrix of an unbalanced assignment problem is not a ______
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.
To solve the problem of maximization objective, all the elements in the matrix are subtracted from the largest element in 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.
