Register

UGC NET CSE | December 2014 | Part 3 | Question: 69

• recategorized by
7,902 views
3 votes
3 votes

Five men are available to do five different jobs. From past records, the time (in hours) that each man takes to do each job is known and is given in the following table :

Find out the minimum time required to complete all the jobs.

  1. $5$
  2. $11$
  3. $13$
  4. $15$ 
• recategorized by
User Avatar

1 Answer

4 votes
4 votes

ans is C 13

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

Related questions

10.0k
views
1 answers
0 votes
makhdoom ghaya asked Jul 11, 2016
9,984 views
UGC NET CSE | June 2014 | Part 3 | Question: 59
The given maximization assignment problem can be converted into a minimization problem bySubtracting each entry in a column from the maximum value in that column.Subtracting ... Adding maximum value of the table to each entry in the table.
User Avatar
3.7k
views
1 answers
3 votes
go_editor asked Aug 2, 2016
3,714 views
UGC NET CSE | Junet 2015 | Part 3 | Question: 67
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 ... number ofrows or columnsrows + columnsrows + columns -1rows + columns +1
User Avatar
3.7k
views
2 answers
1 votes
go_editor asked Jul 22, 2016
3,733 views
UGC NET CSE | September 2013 | Part 3 | Question: 14
An optimal assignment requires that the minimum number of horizontal and vertical lines that can be drawn to cover all zeros be equal to the number ofrows or columnsrows + columnsrows + columns -1rows + columns +1
User Avatar
6.8k
views
3 answers
2 votes
go_editor asked Jul 7, 2016
6,824 views
UGC NET CSE | June 2012 | Part 3 | Question: 62
The optimal solution of the following assignment problem using Hungarian method is ... (II)}$\text{(A)-(I), (B)-(IV), (C)-(II), (D)-(III)}$
User Avatar
Link Copied!