Total No. of Questions: 8] SEAT No. : P537 [6004]-459 [Total No. of Pages :4 ny BE (Cw OPERATIONS RESEARCH (2019 Pattern) (emesger-viD (Elective-III) (401003-F) Time : 2% Hours] Mn" SY [Max. Marks : 70 Instructions to the candidqies: D) Solve Qt or.3)03 ghOA, O5 or 06, Q7 or OB. 2 Figures t ni® righteside indicate full marks. 3) Use of Kaleritargis allowed. - Assui Spee ifnecessary, Ql) a) Explaingtte following in the context of assignment problem [6] i Tite Hungarian Method ra ii) Infesible assignment ve ‘ - b) Unit cost of transporting precast fst fin four factories to three sites is given along with availability2at dach ACtory and the requirement on cach site, Obtain optimal spliition géininimize cost of transportation using VAM method. — (12) ie) 3h Mbply A BL TERA 5 B [3|3] 7/2] 8 a p ray ce [s|4]af 3} 7 “a dp Lite felts} wu we es Demand 7 9 18 6 oO” oe v a os Q2) a) Six different jobs J1,J2, J3, J4 JS and J6 arétobe wlked ona machine tool with setting times as given in the foll maltix, Itis necessary that a job once undertaken will not be haidie4 agit tll all other jobs are finished. Decide the sequence of jobs which gives minimum elapsed time, Yi (12) 2 NNext jobs No 3 4 Isvs6 uN Eppa Ts 2 pi] yiNsl.3| 17 [16 B {23 19/" vio [22 [io Jobs a bio [Gi] - [20 [a1 Before ISH] 1G) a7 aa | - [a7 $186 20| 24] 19 [6] a =a A Q3) a) In’Simplex problem, explain the two phase method and its applications Sy 18] Diese b) Whatare the advantages of kingar prostamming problems? (4) ©) Define the following tem Findicafe their significance of decision making with linear programmin; simplex method: (6) ) Keyeloumn CSY’ ii) Key row Y : 7 AY so” OR os 4) a) Solve using Simplex Method 13] Maximize Z2x,-4x,+5x,-6x, Subject to x, +4x, -2x, +8x, <2 = + 2x, +3x,+4x, 51 oO XpXpXe%, ZO & b) Under which circumstances, Big M method ylised? 4] c) Explain the significance of surplus and stask variables. 16) S [6004]-459 2Q5) a) b) 06) a) b) Q7) a) Optimize Z = =x? — x2 + 4x, 49x, (10) Subject to a A 4x, +3x, =15 L 3x, +5x,=14 oy Pa Hm20 OO So wv Use Lagragita Matiplier technique Give eSrgioness in steepest ascent/descent method. 71 Q oy OR eS otowing 1 i ARSsian matrix i Gradient vector A company sells two types of ite nA and’B. On item A, three is no discount and is sold at a fixed.6PpficesSP Rs. 250 per unit. The sales revenue for item B is given as.(40-0. 40%, )x, Where x, is the number of units sold. The marketin; édptrimei has only 1,500 hours available for selling these items in th jest year Further the company estimates the sales time function as. i + 0.3x? +3x, +0.5x2. The company can procure a maxifuim of°67000 units of the two products combined. Formulate the mathemati model of the problem to maximize,the revenue. Opponent 2 1203 A |6 | 15] 30 Opponent B [3 | 3] 6 c [12 | 12] 24} 33s} YY Give optimum strategy for both the opposidats and find value of games N N [6004}-459 3b) Q8) a) b) stment project, Seven salesmen are to be appointed for i nize the sales. the sale in cach zone wart the number o: as given under Findlthe optimum allocation. 191 IN. of salesmen | 0 we} 3] 4] 5s] 6] 7 I Zone 1 la #47 [2] 16! 19 | 21 | 22 Zone 2 QoP3 410 | 17] 22] 25 | 27 | 27 Zone 35> [@S] 3 [6 [10] 15] 19] 22 [23 a & RY oy os replagénient of any machine? What are the types of costs to be consigiéred for calculating the replacement year > 19] Wille the applications of following,OR tectiiqus in the filed of Civil Engineering. ao a [8] i) ii) (6004]-459 4Total No. of Questions : 8] SEAT No. : 319050006 PA-1658 [Total No. of Pages: 4 15927, be B.EMCivil) OPERATIGNS RESEARCH (2019 Pattern) (Sginest¥-VI) (Elective-I]) (401003-F) Time : 2% Hours] 2% Wy ([Max. Marks : 70 Instructions to the cangltlages: 03 QU, Q5 or 06, and Q7 or 8. right Sile indicate full marks. 3) Use of dgléwlatorSB allowed. 4 Assugsiabiata if necessary. Ow QI) a) Solve, Aliowing example using simplex method. ws Maxitnize Z=20x,+25x, Sqbject to a 181 & 12x, +16x, $100 16x, +8x, $80 Xx 20 b) State the advantages o; [4] c) Define the following ecision making, with linear programmin, for i) KeyColumn a i) Keyrow YY 199) Q2) a) Solve using simplex method. oo Wy [8] v Maximize Z=2x,+x, = S Subject to oS S a 4x, +3x, $12 & Y Ax, +x, $8 oy 4x,-¥, 58 vo x)%20 Ss PTO.[4] b) Write the steps involved in two phase simplex method. c) Explain the following w.rt. LPP. Ge suitable example. 16] i) Entering variable. ii) Leaving variable. s iil) Artificial var ile. Ss 03) a) oar aie Kin VAM 161 b) Optimize foll6Wing.{ahsportation problem using VAM. Optimize using u-v meth, ~ Es only. [12] 1 m D3 D4 Supply s Se 3 S 6 q 30 = o 3. ; 7 8 15 : 6 5 8 6 Demat” 10 25 18 7 ~ v OR 4) a) AX8ompany has four machines on ten fe Sis are performed. Each job can be assigned to only one me€hine. ie cost of each job on each machine is given in the followi rani ‘Sptimize the assignment to get minimum cost. [8] ~ A Cc D 1 > > 39 52 = 2 i¥'29 49 65 3 3 27 39 60 51 4 4%] 50 48 52 b) Find initial sohiiontptsBiloeiad transportation problem sig” | i) Column minin’a method oy ave i) Row minima method M5? on A B c ung” 1 20 70 0 Sy @ 2 30 30 os gi 3 50 40 FO ro 4 10 60 Ae Ws 140 Demand 70 90 180 Which method gives the least cost for thegove problem? c) What is meant by unbalanced assigngfignt problem? State the steps to solve such problem. S [5927]-335 2 14]Q5) a) b) °) Q6) a) b) °) Q7) a) Optimize Z = x} +x} +323 +103, £8x, + 6x, -100 16] . SN Subject to x, +x, +x, =20 we 2 XyXg,8 20 S" S Use Lagragian mld lin BShnique, Camy out thecaldulgQoa for finding the maxima of following equation using Fibgntei mefiod with 1% accuraey in the interval (2,5) upto two interatign&only.<& oa ‘> ide agi AS 12x 45x44 40x + 5 [3] hajYarersimilarities between Golden section method and Fibonacci eS method?) 13] o \ 6” 7 Maximize Z = 6x, +8x,—32 Subject to % 4x, + 3x,=16 Ss 3x,45x,515 = x, x, 20 oS S Be S : . , ‘What are the managet Paegion making applications of mathematical non linear programmiinfs mtcls? D Using Hessian matrix, dfleimine whether following function is convgXor concave. f(x) = TaLheg +7x} — Axx, + 2x15 —4x,x, Re [4] XS > Consider following payoff matrix for two opponent? a, 191 Opponent2 x RY Pe OS A 1 7 = gy 5 Opponent 1B 0 3 we 7, S 8 c 5 2 > Gy 10 i) Check whether there exists saddle pot ii) Give optimum strategy for both th ms iii) Find the value of Game nol - [5927]-335 2b) Find the shortest Path between nodes | a method ind 9 using Dynamic programming 18] REGhonter on the arrows pees the wage in kms. Q8) a) A transit mixer is purchased ee years. The running cost and following table. aes with expected life as 10 site AF in lacs of Rs. is given in the 1] gf eA annie Running aS i 95 | 10.9 12.8] 14] 16 fy Resale Price 28 | 27: Mh cost | 6 | 6 eats Vv 26 | 24 22.5| 21 17 Find the replacement year for the wheel loader. s b) Write the applications of following OR ee ee of owl engineering i) Replacement analysis. ii) Dynamic Programming. [5927]-335 [8] ee OY » Ww Or 8 wy aD