search
Log In
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
3 votes
1k views

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
1k views

1 Answer

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

0 votes
1 answer
1
1.3k views
The given maximization assignment problem can be converted into a minimization problem by Subtracting each entry in a column from the maximum value in that column. Subtracting each entry in the table from the maximum value in that table. Adding each entry in a column from the maximum value in that column. Adding maximum value of the table to each entry in the table.
asked Jul 11, 2016 in Optimization makhdoom ghaya 1.3k views
2 votes
1 answer
2
1k views
Given the following statements with respect to linear programming problem: S1: The dual of the dual linear programming problem is again the primal problem S2: If either the primal or the dual problem has an unbounded objective function value, the other problem has no feasible solution S3: If ... the two problems are equal. Which of the following is true? S1 and S2 S1 and S3 S2 and S3 S1, S2 and S3
asked Aug 2, 2016 in Optimization jothee 1k views
3 votes
3 answers
3
2.1k views
Consider the following transportation problem: The initial basic feasible solution of the above transportation problem using Vogel's Approximation method (VAM) is given below: The solution of the above problem: is degenerate solution is optimum solution needs to improve is infeasible solution
asked Aug 2, 2016 in Optimization jothee 2.1k views
2 votes
3 answers
4
1.7k views
The optimal solution of the following assignment problem using Hungarian method is I II III IV A 8 26 17 11 B 13 28 4 26 C 38 19 18 15 D 19 26 24 10 A B C D A I II III IV B I III II IV C I III IV II D I IV II III
asked Jul 7, 2016 in IS&Software Engineering jothee 1.7k views
...