Multiple Choice
Every basic feasible solution of a general assignment problem, having a square pay-off matrix of order, n should have assignments equal to
A) 2n+1
B) 2n-1
C) m+n-1
D) m+n
Correct Answer:
Verified
Correct Answer:
Verified
Related Questions
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
Q6: The Hungarian method for solving an assignment
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