= R TABLE 4.117 TABLE 4.118 III IV V Dm 1 11 III IV V Dm P 40 40 35 25 50 0 20 20 25 35 10 60 04230 16 25 27 0 018 30 44 35 33 60 R 50 48 40 60 SO 0 R 10 12 20 0 10 60 S 20 19 20 18 25 0 S 40 41 40 42 35 60 T 58 60 59 55 530 T 2 0 1 5 7 60 U 45 52 38 50 490 U 15 8 22 10 1160 Balanced maximization problem Balanced minimization problem TABLE 4.119 TABLE 4.120 III IV V Dm 111 III IV V Dm P101015 25 050 P1010 1425 25 0012 26 17 15 42 Q10 12 25 17 15 17 R 10 12 20 0 10 60 R 10 12 19 0 10 35 s $ 6 5 7 0 25 S 5 6 4 7 XO T 2015 7 60 2 XO 5 7 35 U7014 2 3 52 U 7 13 2 27 Partially reduced matrix Optimal solution . Optimal assignment policy when batsman 'U' is included is Barsman Batting position No. of runs P V 50 Q I 42 R IV 60 D. 142 II 263 Since number of runs increases by including batsman 'U', he should be included in the team. Batsman 'S' will be replaced by him EXAMPLE 4.8-4 A solicitors firm employs typists on hourly piece rate basis for their work. There are five typists and their charges and speeds are different. According to an earlier understanding only one job is given to one typist and the typist is paid for full hour even if he works for a fraction of an hour. Find the least cost allocation for the following data: Rate/hour No. of pages ist Job typed hour Number of page 199 4 12 775 14 145 8 298 10 T 178 E // [WT.U. Karnataka B.E. June, 2011; R.ZM. Nagpur U.B.E. (11) 2009; P.T.U. B.Tech. (Mech. Engg.) 2010; Davalbagh Edu. Inst. Agra MBA May, 2005; PU. BBA, 2001: CA. Nov, 1996) B C 5 6 3 + R S +