Question 15869 – STQC-NIELIT SC-B 2021
December 3, 2023Question 7159 – NVS PGT CS 2019 Part-A
December 3, 2023LPP
|
Question 3
|
In the Hungarian method for solving assignment problem, an optimal assignment requires that the maximum number of lines that can be drawn through squares with zero opportunity cost is equal to the number of:
|
rows or columns
|
|
|
rows + columns
|
|
|
rows + columns – 1
|
|
|
rows + columns + 1
|
Question 3 Explanation:
In the Hungarian method for solving assignment problem, an optimal assignment requires that the maximum number of lines that can be drawn through squares with zero opportunity cost is equal to the number of rows or columns.
Correct Answer: A
Question 3 Explanation:
In the Hungarian method for solving assignment problem, an optimal assignment requires that the maximum number of lines that can be drawn through squares with zero opportunity cost is equal to the number of rows or columns.