ent Problems 149 REVIEW QUESTION alain Assignment Problem with is types ne prefer 5.1 and 5.2 ; @ Bon the Hungarian method to solve an assignment problem oe er 5S fa) tow doen resolve degeneracy in an Assignment problem, ns: oe ‘yen the no of ines + size of malix,The solution isnot optimum, In order to remove degeneracy, we need to perform “iteration” to ob pfu sotion : “Take the least value from all the uncovered elements, Subtract it from the vemsining elements. Addi atthe points of intersection. Al other values remain the same. {ay How wil you determine multiple epinal solitons in an assignment problem? Ans. ‘When an assignment problem has more than one optimal solution, itis oun as muliple of allemative optimum solution. We can determine muitiple optimal solutions when there are multiple zeroes inany row or column in the final table during an assignment. Itmeans that we have the flexibility of allocating diferent assignments to a patelr job or worker while still maintaining the opsimum soliton. EXERCISE “The following information is available regarding four different jobs to be performed and about the clerks capable of performing the jobs. Cost of cach assignment is given in the table below: aw JOBS (cost in hundred rupees) A B ce | D I 4 7 5 6 eae I = 8 7 6 i 3 = 5 3 Nv 8 6 4 2 Cletk I cannot be assigned to job A, and Clerk Ill cannot be assigned to ignment schedule and job B. You are required to find out the optimal asicomo tas 2a en a pa ee Be on xh he four oie am ea peampany 3 Byteman tw yn (umn of ip ae gen nthe accompanying at Dieels unable to cary out project 3 and therefore submite ne apettems 1959 anna mati. Find he @ ram coe needed. Coes a (@) Use the Fiungarian method to find the set of assignments, (0) Wats he mininum ol achiwabe cos? (M0. Ape 2919 (8) Aa EngnesingCompay bas ances in Mab Caleta, a | Nagar. A branch manager fo be apoined one at each dy, wt four candidates A, B, C and D. Depending on the branch, | the iy the monly business nthe cy vases in bs of pen, details below: Branch my Reompany w appointed at ¢ gen below: Se Suggest which manager should be assigned to which city so as te gh ‘maximum total monthly business. (M.U,, Apxil 2019) (4) The following maltix. Find the optimum assignment that will resultin'te minimum cost needed. Job A . @ Man rl ole BS 5nt Problems (8 piu eos needed. Costs give in thousand, Jobs Machin a de i ang matte, Find the-opiman wane FF se folowing matrix Find the optimum assignment that will result in the ds Ms 9 i i Js 15 10 i Me 12 9 10 9 Ms ul 4 1 7 Me 4 8 2 7 8 y ste the folowing minimal assignment, Hence, find the minimal value, Machine Job B c I Fa i 10 4 6 alelrle = B nv alHlolal o a & ajven below: ‘company has four salesman appointed at centre, The business depends and four counter, One salesman has ‘upon the capacity of. Counter Salesmé a Ge Cs ce Si 43 72. 50. Se a1 o1 37 Se 74 78 28 42, 27 49 Si 36 i 37. 22 should be maximised? {8) Salve the following minimal assignment, Costs given Which salesman should be appointed to which cot in hundret unter so that profi find the minimal value, Jobs x 2 Man 1 5 4 2 6 2 3 7 6 4 3 7 salesman id. Hence,152 (9) (10) (a) (2) (3) (4) 6) 6) @ (8) (9) Operations Research (T-y Joyees and five cases. Deterpn ine ‘has five emp! i the employees 50 that number of gaye A fi cases 10 assignment of ‘complete these five Oe a ‘cases will be minimum. Also fing z a number of days Ting E ces [ola | & | a [s] rs | 2 4 2 Bs je 52 EB es} as - a = B 6 3 a 1 [> E 4 2 2 3 |] | es 3 [6 4 7S Four mans are assigned for four jobs. The profit matrix (in thousang; follows: mae eee 2 T 3_ [2 [2 10 Zz 8 14 14 7 3 8 15 13 5 4 10 12 i 8 Solve asignment to find the maximum profit from four mans. ANSWERS: Optimal Cost = Rs. 1,800 Optimal Cost (Minimum Cost) = Rs. 94,000 Optimal Profit = Rs. 23 lakhs Minimum Cost = 31 Minimum Cost = Rs. 48,000 Minimum Value = 14 Maximum Sales = 265 Minimum Cost = Rs. 1200 Minimum Days = 11 days (10) Maximum Profit = 49,000