Multiple Choice
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
Correct Answer:
Verified
Correct Answer:
Verified
Related Questions
Q1: Every basic feasible solution of a general
Q2: Maximization assignment problem is transformed into a
Q3: Priority queue discipline may be classified as<br>A)
Q4: Which of the following is not a
Q5: An assignment problem is considered as a
Q7: The purpose of a dummy row or
Q8: Which of the following characteristics apply to
Q9: To proceed with the MODI algorithm for
Q10: If there were n workers & n
Q11: Customer behavior in which the customer moves