Register

UGC NET CSE | June 2014 | Part 3 | Question: 59

• recategorized by
9,857 views
0 votes
0 votes

The given maximization assignment problem can be converted into a minimization problem by

  1. Subtracting each entry in a column from the maximum value in that column.
  2. Subtracting each entry in the table from the maximum value in that table.
  3. Adding each entry in a column from the maximum value in that column. 
  4. Adding maximum value of the table to each entry in the table. 
• recategorized by
User Avatar

1 Answer

Voting & Accepting an answer helps improve the community
Answer:
← PreviousNext →
← Previous in categoryNext in category →

Related questions

1 votes
1 votes
1 answer
2
makhdoom ghaya asked Jul 11, 2016
2,962 views
UGC NET CSE | June 2014 | Part 3 | Question: 60
The initial basic feasible solution of the following transportion problem: is given as 5 8 7 2 2 10 then the minimum cost is 76 78 80 82
The initial basic feasible solution of the following transportion problem:is given as5 8 7 2210then the minimum cost is767880 82
User Avatar
1 votes
1 votes
1 answer
3
makhdoom ghaya asked Jul 11, 2016
3,482 views
UGC NET CSE | June 2014 | Part 3 | Question: 58
Which of the following special cases does not require reformulation of the problem in order to obtain a solution ? Alternate optimality Infeasibility Unboundedness All of the above
Which of the following special cases does not require reformulation of the problem in order to obtain a solution ?Alternate optimalityInfeasibility UnboundednessAll of th...
User Avatar
2 votes
2 votes
3 answers
4
go_editor asked Jul 7, 2016
6,492 views
UGC NET CSE | June 2012 | Part 3 | Question: 62
The optimal solution of the following assignment problem using Hungarian method is ... $\text{(A)-(I), (B)-(IV), (C)-(II), (D)-(III)}$
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...
User Avatar
Link Copied!