Computer sciene duncle.com order ot tha ble. the number of lines drawn is 5, which is equal to the is reached the optimal assignments are shown in tabider of op

Computer Sciene duncle.com order ot Tha ble. The number of lines drawn is 5, which is equal to the is reached the optimal assignments are shown in tabider of Optimal assignment: men 5 3 4 2 3 7 3 5 6 8 4 1 2 4 Job 1 4 4 IV 1 1 v L2 2 Therefore, the optimal solution is Men Time Job 2 15 4 14 1 21 5 20 3 16 Total time 86 hrs. There are mainly four methods so called Enumeration metho transportation method and Hungarian method for solving Assignme The initial solution of a transportation problem is said to be non-deg solution if it satisfies (D) (D) () The solution must be feasible i.e. it must satisfy all the ) constraints (i) The number of positive allocatinns munt h