Sonali Asked a Question
March 11, 2021 3:35 pmpts 10 pts
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
  • 1 Answer(s)
  • 1 Likes
  • 3 Comments
  • Shares
  • Neha tarar thankyou
    Please refer attachment.
    • cropped1646589178.jpg
    Likes(0) Reply(0)
  • Sonali
    after row and column reduction how select 0's
    • cropped2161576503954878313.jpg
    Likes(0) Reply(0)
  • Sonali
    how they select 0's ??
    Likes(0) Reply(0)
Head Office :
MPA 44, 2nd floor, Rangbari Main Road,
Mahaveer Nagar II, Kota (Raj.) – 324005

Corporate Office:
212, F-1, 2nd Floor, Evershine Tower,
Amrapali Marg,
Vaishali Nagar, Jaipur (Raj.) – 302021

Mail: info@eduncle.com
All Rights Reserved © Eduncle.com