MCQ
Using the Hungarian method the optimal assignment obtained for the following assignment problem to minimize the total cost is:
AGENTJOB
ABCD
110121525
214111932
318212329
415202628
  • $1- C , 2- B , 3- D , 4- A$
  • B
    $1- B , 2- C , 3- A , 4- D$
  • C
    $1- A , 2- B , 3- C _1 4- D$
  • D
    $1- D , 2- A , 3- B , 4- C$

Answer

Correct option: A.
$1- C , 2- B , 3- D , 4- A$
$1- C , 2- B , 3- D , 4- A$

Need a full question paper?

Generate a complete, print-ready paper with questions like this in minutes — across 16+ boards, with answer keys.

Start Generating Free