An optimal assignment requires that the maximum number of lines that can be drawn through squares with zero opportunity cost be equal to the number of.
A. Rows or columns
B. Rows & columns
C. Rows + columns – 1
D. None of the above
Select an option to see the answer and solution.
While solving an assignment problem, an activity is assigned to a resource through a square with zero opportunity cost because the objective is to?
A. Minimize total cost of assignment
B. Reduce the cost of assignment to zero
C. Reduce the cost of that particular assignment to zero
D. All of the above
Select an option to see the answer and solution.
The method used for solving an assignment problem is called.
A. Reduced matrix method
B. MODI method
C. Hungarian method
D. None of the above
Select an option to see the answer and solution.
The purpose of a dummy row or column in an assignment problem is to.
A. Obtain balance between total activities & total resources
B. Prevent a solution from becoming degenerate
C. Provide a means of representing a dummy problem
D. None of the above
Select an option to see the answer and solution.
If there were n workers & n jobs there would be.
A. n! solutions
B. (n-1)! solutions
C. (n!)n solutions
D. n solutions
Select an option to see the answer and solution.
An assignment problem can be solved by.
A. Simplex method
B. Transportation method
C. Both a & b
D. None of the above
Select an option to see the answer and solution.
For a salesman who has to visit n cities which of the following are the ways of his tour plan.
Select an option to see the answer and solution.
The assignment problem.
A. Requires that only one activity be assigned to each resource
B. Is a special case of transportation problem
C. Can be used to maximize resources
D. All of the above
Select an option to see the answer and solution.
An assignment problem is a special case of transportation problem, where.
A. Number of rows equals number of columns
B. All rim conditions are 1
C. Values of each decision variable is either 0 or 1
D. All of the above
Select an option to see the answer and solution.
Every basic feasible solution of a general assignment problem, having a square pay-off matrix of order, n should have assignments equal to.
Select an option to see the answer and solution.
To proceed with the MODI algorithm for solving an assignment problem, the number of dummy allocations need to be added are.
Select an option to see the answer and solution.
The Hungarian method for solving an assignment problem can also be used to solve.
A. A transportation problem
B. A travelling salesman problem
C. A LP problem
D. Both a & b
Select an option to see the answer and solution.
An optimal solution of an assignment problem can be obtained only if.
A. Each row & column has only one zero element
B. Each row & column has at least one zero element
C. The data is arrangement in a square matrix
D. None of the above
Select an option to see the answer and solution.
The objective functions and constraints are linear relationship between _____________.
A. Variables
B. Constraints
C. Functions
D. All of the above
Select an option to see the answer and solution.
Assignment problem helps to find a maximum weight identical in nature in a weighted ____________.
A. Tripartite graph
B. Bipartite graph
C. Partite graph
D. None of the above
Select an option to see the answer and solution.
All the parameters in the linear programming model are assumed to be ____________.
A. Variables
B. Constraints
C. Functions
D. None of the above
Select an option to see the answer and solution.
The solution need not be in ___________ numbers.
A. Prime Number
B. Whole Number
C. Complex Number
D. None of the above
Select an option to see the answer and solution.
Graphic method can be applied to solve a LPP when there are only _____________ variable.
A. One
B. More than One
C. Two
D. Three
Select an option to see the answer and solution.
If the feasible region of a LPP is empty, the solution is ______________.
A. Infeasible
B. Unbounded
C. Alternative
D. None of the above
Select an option to see the answer and solution.
The variables whose coefficient vectors are unit vectors are called ____________.
A. Unit Variables
B. Basic Variables
C. Non basic Variables
D. None of the above
Select an option to see the answer and solution.