“i. (QM sem EL iq]uleaxe QP. Code :31261 [Wime: 24 Hours} [Marks:75] Please check whether you have got the right question paper, All questions are compulsory. Figures to the right indicate full marks, Use of non-programmable calculator is allowed. Normal distribution table is printed on last page. ‘Support answers by diagrams where applicable. Graph paper will be supplied on Request. NB: Q.1 Attempt any two questions : 1a) Use Simplex method to solve the following Linear programming problem 18 Maximize Z = 3x, + 7x2 ‘Subject to the constraints, 2x, +5x2 S20 xy 2x <4 m20% 20 b) Use Graphical method to solve the following Linear programming problem 15 Maximize Z = 8x, + Sy Subject to the constraints, Sxq + 3x, 230 2x, + Sx, 220 at $8 2, 20.% 20 ©) Answer cach question in brief. id Discuss characteristics of Operations Research. 25 ii) Explain “Redundant Consiraint™in Graphical Method of LPP. 25 iii) Write the Dual for the following Problem, 28 Minimize Z = Bx; + 2x, + 3x Subject fo the constraints, xy + 3x2 + 5x5 2 18 4x, + 2x, +4327 ¥y 20,2 2 0,,x,20 Q2 Attempt any two questions: 2). Four jobs are to be assigned to four workers on one to one basis. Cost of each assignment is 7.5 ven in Rs, Thousands, Find optimal assignment of job and worker to minimize total cost, Workers [_ Jobs a A B c D ‘Sunil 4 6 4 2 Sainil 12 3 6 Sie Anil 3 9 es 3 Swapail 6 3 3. | 2 Page 1 of 6Q.P. Code :31261 b) The quantity of different products (in units) produced by the workers per day are given in 7.5 the following matrix along with the profit in Rs. Per unit. Formulate'a Profit Matrix and find the optimal assignment of w Workers I Pencil ‘Amit | 30 | Sumit I 25 Vint | 40 ~ Punit 35 | Profit in Rs. Per 4 Unit t ©) There are 3 Factories A, B, C and three Markets X, Y and Z. Supply at the Factories is 60, 80 and 85 units. Demand at the market places is 75, 110 and 40 units. The supply and Demand of units with unit cost of Transportation (in Rs.) and the schedule followed from Factories to Markets are given below: (The numbers which are shown in jumber of units transported from Factories to Markets.) a Costin Rs) kets | x 2 Supply Factories a So) (60) 0 € 8 Demand | 40 225 ES i i) Test the given solution for optimality and find optimal Transportation 03 Solution. ii). Find one more optimal alternate Transportation solution 35 iii) Comment upon the managerial significance of altemate/ multiple optimal oO Transportation solution. Q.3 Attempt any two. questions: a) A stall project consists of following activities: ‘Activity | Preceding Activity Time (days) Le A : 6 B ae A 7 ie A 9 D B 12 Ee _ c 7 Lore rk i: ea LEEQP. Code :31261 i) Construct the network diagram and find out critical path and project completion 2.5 time. ii) Calculate Earliest Start Time, Earliest Finish Time, Latest start time and Latest 04 Finish Time for each activity. iii) Calculate Tail Slack and Head Slack for non critical activities. on ) The data for a PERT network is given in the following table. The project manager has made following calculations of Average Expected Times from Optimistie time, most likely time and pessimistic time for various activities of project as well respected standard Deviation and the variance values. Events Expected Time (ie) | Standard Deviation Varianee ig in weeks 12, 3 18 i [es 13 6 1B. v9 23 a T T 24 6 a E 169) 35, 3 43 169 46 2 1B 19 36 4 1B 19. 67 z al a i) Construct the network diagram of PERT network. 28 ii) Identify Critical Path and find the expected completion time of the project. or iii) Find project completion time for 95% confidence level, 0 iv) the fixed cost of the projects Rs.30, 00,000/- and the variable cost is R.20, 000/45 per week. Find the amount the firm should bid under the policy of 95% confidence of completion of the project. (for the purpose of bidding, consider only cost that is break even situation no loss and no profit) ©) Answer each question iti brief i) Whatare the objectives of project crashing? ii) “Discuss the concept of Dimtimy Activity, A iil) Discuss the difference between an Activity and an Event, Q4 Attempt any two questions. a) A department store with a bakery section is faced with the problem of how many cakes to buy order to meet the day's demand, The departmental store prefers not to sell day-old- cakes, Left over cakes are therefore, a complete loss. On the other ‘hand, if a customer desires cake but all of them have been sold, he will buy elsewhere and the sales will be lost, ‘The store has therefore, collected information on the past sales based on 100 day period as shown in the table below: Sales (units) 35 26 Sy 28 Probability 02, 04 03) Or 4) Construct the conditional Pay-off (profit) table. 25 4i) Calculate Expected Pay-off (profit) using EMV method and suggest best course of 03 action. What is the optimal number of cakes that should be bought each day? A cake costs Rs.10/- and sells for Rs.15/- iti) Calculate the Expected Value with Perfect Information, (EVPD) oy Page 3 of 6