in Optimization recategorized by
3,560 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
in Optimization recategorized by
3.6k views

1 Answer

3 votes
3 votes
Best answer

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

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true