Operations Research - Study Mode
[#291] An assignment problem can be solved by.
Correct Answer
(C) Both a & b
Explanation
Solution: An assignment problem can be solved by Simplex method and Transportation method. The simplex method is a method for solving problems in linear programming. This method, invented by George Dantzig in 1947, tests adjacent vertices of the feasible set (which is a polytope) in sequence so that at each new vertex the objective function improves or is unchanged. The Transportation Method of linear programming is applied to the problems related to the study of the efficient transportation routes i.e. how efficiently the product from different sources of production is transported to the different destinations, such as the total transportation cost is minimum.
[#292] For a salesman who has to visit n cities which of the following are the ways of his tour plan.
Correct Answer
(C) (n-1)!
Explanation
Solution: For a salesman who has to visit n cities (n-1)! is the way of his tour plan.
[#293] The assignment problem.
Correct Answer
(D) All of the above
Explanation
Solution: The assignment problem requires that only one activity be assigned to each resource, is a special case of transportation problem and can be used to maximize resources.
[#294] An assignment problem is a special case of transportation problem, where.
Correct Answer
(D) All of the above
Explanation
Solution: An assignment problem is a special case of transportation problem, where Number of rows equals number of columns, all rim conditions are 1and values of each decision variable is either 0 or 1.
[#295] Every basic feasible solution of a general assignment problem, having a square pay-off matrix of order, n should have assignments equal to.
Correct Answer
(B) 2n-1
Explanation
Solution: Every basic feasible solution of a general assignment problem, having a square pay-off matrix of order, n should have assignments equal to 2n-1.