DEPARTMENT OF MANAGEMENT STUDIES INDIAN INSTIUTE OF TECHNOLOGY , MADRAS Quis 1 Course : MS 351 Fundamentals of Operations Research Date: "18 September, 2010. Duration ; 50 minutes Maximum Marks: 20 a A city hospital has the following minimal daily requirements for nurses. Period | Clock Thne(24 Hours day) | Minumum Number of Nurses required £ Gam-10am 2 2 10 a.m - 2 pan T a 2pm-6 pam 15 4 pan - 10 pam & 5 0 pm -2 a.m 20 6 LL 2am-Gam 6 Nurses report at the hospital at the beginning of each periad and work for 8 consecutive hours. The hospital wants to determine the ininimal number of nurses to be employed so that there will bea sufficient number of nurses available for each period, Formulate this as a linear programming problem by defining the decision variables, setting Up appropriate constraints and objective function [& marks} 2, Put the following linear programming probler in standard form Min 1x, + 22 — 53 Subject to ty +my < Ww m2 = 1 tot Ty <4 to +83 2 ot aptopt2; = W Zits 2 0 xy unrestricted |2 marks) A. Consider the following linear programming problem Maximize 2) +72 Subject to 2m+a, S 4 m+2my S 4 mu-—m < 1 Tym 2 ef4) Salve the problem graphically indicating cleurly the feasible space and the direction in which the objective function improves: {8 marks| (b) Introduce élack variables 23,24 and ty, Start with the basis B = [a5,44, ag| corre- sponding to the slack variables. Give one iteration of the simplex algorithm. State your steps clearly (5 marks|ae Consider the following simplex tableau which is obtained solving 8 maximization prob- jem with 3 constraints and 3 variables. The variables 51,52 and sg correspond to the slack /surplus variables, (a= | Is the current tableau optimal? If not, apply the simplex method to compute the next tableau [5 marks|