recategorized by
3,554 views
3 votes
3 votes

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 be equal to the number of

  1. rows or columns
  2. rows + columns
  3. rows + columns -1
  4. rows + columns +1
recategorized by

1 Answer

Best answer
3 votes
3 votes

ans is A 

maximum  number of lines that can be drawn through squares with zero opportunity cost be equal to the number of

rows or columns

selected by
Answer:

Related questions

2 votes
2 votes
3 answers
4
go_editor asked Jul 7, 2016
6,406 views
The optimal solution of the following assignment problem using Hungarian method is$\begin{array}{|l|l|l|l|} \hline \text{ } & \text{I} & \text{II} & \text{III} & \text{IV...