{ANG A A RC-5533 M. B. A. (F.T.) (Sem. III) & (E.) (Sem. V) Examination March / April - 2017 Applied Operations Research Time : 3 Hours] [Total Marks : 70 Instructions : qa) Seat No.: COL oa caida og Feudal Rad étaadt we uae andl, Fillup strictly the details of ‘@ Signs on your answer book. Name of the Examination : M. B. A. (F.T.) (Sem. I) & (E) (Sem. V) Name of the Subject : | Applied Operations Research 8 X1,X2 2 0 & Integers. Q.7 Following is minimizati ng s minimization transportation problem feasible solution. Is it optimal ? If not get optimal solution. D, Dz Ds ol 2 Cs) (») 1 4 ° Q.8 Answre the following questions in brief. (a) When do you use “Tick Marking” procedure ? (b) Give justification of the name “Penatty number" w.rt. Transportation Problem. (¢) When do you use the following in LPP ? @ Mi) MMM | form of : FR, IF , IPP, VCE of feasible solution of ‘Transportation Problem’, when jess than (m+n-1) ? more than (m+n-1) ? (d) Give full (e) What is the name number of filled cells are (f) What are various “Floats” with reference to CPM. (g) State few applications ‘of “Queuing” rs in Network ? (h) State possible erro} estricted and Unrestricted variables in LPP 7 (i) What do you understand by Re jethod of LPP ? (j) What are the limitations of Graphical Me EN-5533] [Contd...Q.9 Answer the following questions. (a} State all possible queue disciplines. (b) Explain the steps of Dynamic Programming for optimization. (c) Explain the concept of Goal Programming. (d) Explain the steps of Simulation process.M.B.A. Examinat ion euambera01s— Aer) -2016 [$023 Oct OF & A-301 M.B.A, .e: 3 Hours] [Total marks: 70/100 ructions: Q.1 is of 20 full marks and the Attempt part or full, out of all Ges questions are of 10 marks each. luestions to get total maximum 70 marks. Max Z = 5x1 + 6X2 + 4x3 20) Sit 2x1 + 3x2 + 5x3 < 300 (20) 9x1 + 15x2 + 25x5 < 1500 5X1 +5x2+7x3 < 600 7 X1,X2,X3 20 mplete Final table of above LPP is given below, : i 2 ? ? ? mar Xt x2 X3 wi w2 wa Ale Jl a 1 0 2/5 7 5 8 u ~6 1 3/5 2 po?} 0 u zi 0 3/5 2 , 2 ? 2 ? ? ? ? Write appropriate value / variable at (?) mark positions. | Interpret Optimal Solution. State Loose or Tight constraint against each constraint. | State Optimal solution of Dual of this LPP. Get change in Optimal Solution when 30 is deducted from RHS off first constraint and 30 is added to the third constraint. Get flexibility of coefficient of x2 in objective function to retain same basic variables. | Get flexibility of RHS of third constraint to retain present basic variables. | Ifnew variable is possible to be added with its coefficient in objective function as 5 and in each of the three constraints as 5 , will it be a profitable variable ? Why ? If new additional constraint : 2x, + 3x2 +x3 $< 250 : is added, will it change the present optimal solution ? Why? Solve the following IPP. [10] Max Z = x; + 3x2 + x3 Sit X1 + 2x2 + 3x3 $5 X1,X2,X3 20 and integers. a) Incomplete Initial table of above LPP is given below. 05) 2 1 2 M 2 2 7 . $1 At Aa Wy > 2, 1 2 2 i : 5 ‘ 2 2} 1 2 2 ; ; : : BA 3 2 2 : ? 24 > 7 7 ? ? ? 2 () Complete the this Initial Simplex table (ii) State involved LPP completely. (iii) Write dual of this LPP. ' A derive Gomory’s constraint for ‘All IPP [05] (10) Answer the following questions. | _ (a) State name of person connected with following: : / Hungerian Method, Method of solving IPP, Numbering events in networkSHES ESE err “ssoooid uonejnus Jo sdays ayy urepdxg (p) “BurumumesBorg [20H Jo jdeouoo ay urejdxg (9) ‘uoneziumdo 10y SurumumerBorg ated Jo sdoys oy) urejdxq (q) “sourjdiosip ananb aiqissod ][e a1e1$ (e) ‘suoysonb Surmor[oy ou} Jamsuy 60 v6 08 yi 68 Sd vg g8 _ 1g] td 88 = 08 98 | fd = 28 gg ez | ?d Ey 06 ez | — | ‘d *S &g %s 's Aupeumndo soy oofgng 393 10U ]]IM OYM ‘SsOssAJOId OAL JO NO ‘Wwouludissy yd PUly “SUOHRUTqUIOD sNOLeA JO} sjueprys jo syreur payadxe adeloae SMoys noitt UL “(bS ‘ZS “TS) soalqng moy yowar or (Sd “7d «[q) stossayorg aay o1v 2104], 80 1 Or Or , I 9 co 0c st s z 10 ea ca Id (orl -uoninyos eudo ayp 328 “tou JI guoHNIos feurrdo ss] “Tono] 20ujpjog IM Moog UMoYS st wogord UoHEHodsuPK] JO Suonesorle a1gisead “LO ‘sroSaqu] YO = SIX 3 = T+ 'x OLS + !XE ys axe + INT =Z WN -pomjour punog 7 yourig Busn ‘gaT FuMoz1o} eajos 9D or 4 skep 67 tf aloud Suayduroo Jo Apqeqoad amp st wyAN (HD) é -uoemp tona|diuos aloud Jo uonreAap prepueis arefno[eD (I) yoafoad Jo awn wonardwos peyoadxe puty (1) oc | + 8 5 8 s z a 91 ol t Vv 4 ay 4 Auanov -ad[oq WOATE aie SKep ut Sun AUANOW (sol jpoford mou v Jo yomou LYAd & Ut ped jeonts9 e UO saNLANoe [LORS a2 ‘ay @) zl 6 ol L IL 9 b s (skep) uonemq im y _ _ ‘stossaaapald qa a aoa} oa v Vv ayerpounuy H 9 a | 4 a 9 € Vv Auanoy. “aE 21890] pur eyep BupMo]]OJ WO ONION aypmrig (e) SO qurensuod 2007] “UOHN[OS ayerouadaq] ‘ajqeleA parolisosu) -Bujmorjoy Jo Suruwow ayp Jog UL urejdxq (Pp) IGOW ‘PoMAW xorduus fend “WVA 4 pasn st Buymoyjoy Jo yous yas pue aratiay (©) Sd dl ‘Lad ‘Wad * WAN SBurmoyjoy Jo wr9y 119y AID (A)Veer Narmad South Gujar. i i j at University, Surat (Gujarat) Department of Business Industrial Mvcanentent €E3S M.B.A.(Evening) Sem. Vv; End Semester Examination. : “Mevselh -Atatt- 20U+ Subject : Aslyaneed Operations Research aximum Marks : 70 Feplied Duration : 3 hours struction: Each question carry 10 marks, Attempt any SEVEN questions. Following is a LPP. [10] Max Z = 5x) + 6x; + 9x3 Sit 2x; + 3x2 + 5x3 3000 (Space) 9x1 + 15x) + 25x3 < 15000 (Budget) Sx) + 5x2 + Ixy 6000 (Time) X1,%2,x320 The final table of ‘Simplex procedure Sor above LPP is as under. ? ? ? 0 0 0 1 x2 x3 wy we ws >? 0 1 IMs 1 0 aS ? 2? ? 0 0 5 6 1 B/S ? ene 1 0 5S -l 0 3/5 2 ? ? ? ? ? ? ? (a) Complete the table and interpret the optimal solution, (b) Write Dual of above problem and state solution of dual from optimal solution of primal. (¢) If coefficient of x in objective function is changed to 4, what will happen 2 (4) If space or time can be increased fully, which should be increased fully? Why 2 (©) Ifcoefticients of x3 in all the constraints is changed to 10, will it change present optimal solution ? Average time taken by four operators on four machines and a new machine are given below. [10] Is it advisable to replace any of the old machine by a new machine ? If yes, which one 2 M Mp Ms Ms___New MIC eo 10 12 8 a o 9 10 8 7 10 6s 3 7 8 8 8 7 2 1B 4 ay 1 A firm manufactures two products A & B on which the profit eamed per unit are Rs. 3 and [10] Rs, 4, respectively. Each product is processed on two machines MI & M2. Product A requires one minute on MI and two minutes on M2. Product B requires one minute each on both machines. Machine M1 is available for not more than 7 hours and 30 minutes, while machine M2 is available for exactly 10 hours during any working day. To optimise the situation, formulate this problem as LPP. Get optimal solution using Simplex Method,Q5 Q6 Q7 The final table of Simplex Method for above LPP without con: Max Z = x1 +%2 St 3x +2x255 x2 $2 x1, X2 210 and Integers sidering Integer constraint is as under. 1 1 0 0 RHS x! x2 wi Wo 1 Xt 1 0 1/3 2/3 1/3 1 x2. 0 1 0 1 2 0 0 V3 V3 73 (i) Using Cutting Plane Method, get Optimal Integer Solution. (ii) Convert Cutting Plane Equation in terms of decision variables. [a] _ Define and explain the following terms : (i) Degenerate Solution (ii) Unrestricted Variable [.b] A company has three factories and three warehouses. Weekly factory capacities 4re200,160 and 90 units respectively. Weekly warehouse requirements are 180,120 fand 150 units respectively. Unit shipping costs in Rs. are as given below. Find optimal distribution and optimal cost. Factory Warehouse ] Wi W2 w3 Supply Fl. 16 20 12 200 F2 14 8 18 160 F3 26 24 16 90 Demand 180 120 150 [a] _ Explain the following terms with respect to the Queue System. (i) Queue discipline (ii) Balking [b] A self service store employs one cahier at its counter, 8 customers arrive on ar ‘average every 5 minutes while the cahier can serve 10 customers in the same time, Assuming Poisson distribution for arrival and exponential distribution for service rate, determine = (i) Average number of customers in the system (ii) Average queue length (iii) Average time a customer spends in system “(iv) Average time a customer waits before being served (v) Probability that there is no customer at the counter (vi) Average length of the queue formed from time to time (vii) Probability that a customer is being served, but nobody is waiting (viii) Utilization factor (a) How many and what are the methods of solving “Assigment Problem” ? (b)How man 'y constraints are available in 3 by 3 Assigment Problem ? (c) Solve following LPP using ‘Graphical Method’. Min Z=20 x1 + 10 x2 Sit xl+x2 < 40 3x1+x2 2 30 4x1 + 3x22 60 x1,x22 0(a) Draw the network from following d [02] CoA: EDAD Pee ee ete Number the event. . (b) Siena a following and indicate formula for getting them for i -j ee activity using Ei, Ej , Li, Lj and tij durati ce gtsing Ei 4j and tij duration. (¢) Define : Network, Critical Path. ee (d) From the data given below ofa Project, answer the questions. °° Aetivit Immediate Predecessors a m dD A - I 4 2 : = 7 To 16 c 5 ‘i is 24 D A 3 12 is E B 4 4 4 r_. D 5 14 = G CE 2 5 e (i) Find expected time of project completion. (ii) Find standard deviation of project completion duration. (iii) What is the probability that the project will be completed in 35 days ? Answer the following questions in brief. [10] (a) Draw the network where all the three errors are present. (b) Give justification of the name “Penalty number” in w.r.t. Transportation Problem. (c) When, where and why “Dual Simplex Method” is used ? (d) When do you use the following in LPP ? (i) M (ii) MMM (e) What do you understand by “Tight Constraint “ ? (f) Write appropriate sentence containing each of following separately. Dangling, Redundant (g) How do you tackle “assignment Problem” when some assignment is prefixed ? (h) Give full form of : IPP,NWCM, CMM,MODI (i) State atleast TWO types of following: Assignment problem, Network error G) What is the name of feasible solution of ‘Transportation Problem’, when number of filled cells are less than (m+n-1) ? more than (m+n-1) ? (a) Explain the difference between objective of Linear programming and Goal [03] programming. aa (b) What are Random numbers ? Why are they useful in Simulation 2 [03] (c ) State and explain “ Bellman’s Principle of Optimality”. [04 ]Gde- ve. Veer Narmad South Guj ujarat Uni i j M.B.A.(Evenin : '9) Sem. V : End Semester Examination [Nov., 2013] Subject : ‘ubject : Advanced Operations Research Maximum Marks : 70 . Duration : 3 hours Instruction: Each question carry 10 marks. Attempt any SEVEN questions. Max Z = 5x1 + x2 + 2x3 “1 Sit 7 X, +X. +x3 5 6 [Resource 1] eae [ Resource ~ II ] 4% 52 [Resource ~ III} ; X1,X2,%3 2 0 ‘ Following is incomplete final table of Simplex for above LPP. u : ? ? 2 2 RHS by x2 x3 wy wr wi aw] ? 2 ? 2 -6 316 |? 2x1 2 ? ? 2 1/6 -1/6 2 2 x 9 2 2 2 0 1 2 2 2 2 2 ? 2 2 Based on given data, answer the following: ) Complete the table and state the optimal solution. ) Write dual of this LPP and state optimal solution of dual. _ ) Find range of coefficient of x1 in objective function, for which the current basic variables r ain unchanged. hueofZ is ol Z. ) If coefficient of x2 is changed to 2, find revised val “ * ton i ised optimal solution. 7 int is changed to 14, get rev! / vas es i introduced with C= 3 and coefficient af xs in each constraint as 1, If additional variable Xa ! it improve Z. ps [10] ve following LPP using Simplex Method: Min Z = 20x, + 10x2 Sit xy + 2x, $40 3x1 +x2 230 4x1 + 3x2 2 60 xy, x220_ SY Q.3 /nswettte following questions. Ob Ie F (a) State names of any “FOUR” solutions in connection with Linear Programming. (b) State in ONE sentence use of following : (a) VAM (6) Fulkerson’s Rule. (©) Following is “Maximization Transportation Problem” with allocations given in Bold Numbe, A B 3 7 a n 5 3 eT) (i) Isgiven feasible solution optimal ? Ifnot, get it. (ii) Is the optimal solution unique ? (d) State methods of converting “Profit Matrix” into “Relative Cost Matrix”. (@) Give full form of following: IBFS, LPP, MMM. 4 the following: Q.4 Answer the following w (a) Drawa network from following data : Activity. Immediate Predecessors = Following is “Minimization Assignment Problem. Is the optimal solution of this problem unigu (b) If not, how many optimal solutions are possible ? : A B c x 1 3 Y 4 5 6 (¢) Foran activity i-j with following values, find: TS, EFT, LST,, FP. Fj=10, Liz ll, 6-20, Lj=30, ty=8. [c] A,B, Care the activities on a critical path of a PERT Network of a Project. The timings (4) 1 given in table, Answer the questions given-below. 1 Activity to ia tp A 2 3 4 B 5 7 9 Cc 8 I 14 (a) _ Find expected time of completion of project. (b) Estimate Standard Deviation of Project Completion Duration,iswer the following: Following is “Minimization Assignment Probl m ; lem, I i i i ene s the optimal solution of this problem unique ? A B c What is the signi 4 5 * ignificance of value of Vacant Cell Evaluation ina Vacant Cell ? From the following data draw th , e Network, s rk, number the events and find critical _path(s). Activit ie ivity 1-2 3 [ 2-3 uration (days) é 7 — ; maT > 8 8 ‘ wien = a judge ey of Alternative Optimal Solution in Transportation Frblem ? Following is Minimization Assignment Problem. Write “Objective Function” as. well as “Non- ‘ity” condition for this problem. . x A le) 6 . BLS 4 Answer the following: (9) \atare the kinds of Integer Programming Problems ? b) Explain the theme of “Branch & Bound’ method of: solving IPP. ¢) Max Z=x + x2 Sit 3x, + 2x25 ms2* e xX; , X22 0 and Integers . «table of Simplex Method for above LPP without considering Integer constraint is as under 7 1 1 0 0 RHS x x wi w2 1 XI 1 0 13 -2/3 13 1 x2 0 1 0 1 2 0 0 1/3 13 113 | Integer Solution. ne Method, get Optimal Integer of decision variables. (i) Using Cutting Pla t ane Equation in terms (ii) Convert Cutting PI istic i tem. Explain in bri in characteristics of queueing SYS! veer sr brie he aa loys one cashier at its counter. Nine customers arrive on an average every 5 [02] minutes while cashier wee xover 10 10 customers in 5 minutes ‘Assuming Poisson distribution for [08] oe a 4 : arrival rate and exponential distribution for service ae et fl (i) Average number of customers in the sys ii) Average number of customers in the ae (iii) Average time a customer spends in sy’ (iv) Average time a customer spen a i i wail (iv) Average time a customer ve cat Probability that there is no customer at the counter (vi) Utilization Factor isible solution, Alternative optimal solution Q.8 (a) Using sketches explain: Unbounded Solution, Infea: (b ) Solve following LPP using ‘Graphical Method’. Min Z= 3x1 + 5x2 Sit -3x1+4x2 < 12 2x1 + 3x2 2 12 x1 <4 x1,x22 0 Q.9 Answer the following: (a) Explain how Goal Programming is different from Linear programming (b ) Explain Use of Random numbers in Simulation ? (c) State the possible applications of “Dynamic Programming Method” Q.10 Acompany has three plants and four warehouses. The supply and demand in units and the correspe: Transportation costs are given along —_with allocations in following table. W, W2 Wa Ws 5 10 (*) 4 5 10 10 6 8 7 2 © aT a 7N2 5 7 " Ps 20 25 410 15 5 (i) Isthe given solution optimal ? If not get optimal solution. (ii) Is optimal solution obtained unique 7 If not get alternative optimal solution.em. II) & (Evening) . amination October ’ November — 2012 Applied Opera: tion Research . c! Time : 3 Hour: g s] [Total Marks : 100 Instructions : @ A calda q ~ Fp ernest a aS a Name of the Examination ae | MBA. (FT) (Sem. 2)& (Evening) (Sem. 4) Name of the Subject - + Applied Operation Research @ Subject Code No, EEE] Section No.(1,2,...) (8) Figures to the rij ght indicate full marks. (4) Question no, 1 a nd 4 are compulsory questions. Section I Q-1) Materials Management involves optimizing activities from Purchase of raw material till the sales of finished goods. Justify the statement. 18 Marks Q-2) Annual demand for an item as per the forecast is 2500 unit its. The various costs regarding make or buy decision are given below: Unit Cost Make Buy Rs.1/- Rs.10/- Ordering Cost/order | - Rs.15/- Setup Cost/lot Rs85_ : Annual carrying | 20% of unit cost | 20% of unit cost cost ion i i . Determine whether to make or buy the | Rate of production is 7500 units per year. Determine whet ceo item. OR ; brakes that i mn has extra capacity that can be used to produce Naas tas besa “paying for Rs.800/- each. If the company makes the brakes following costs would be incurred. Material Costs = Rs.240/- per oe Labour Costs = Rs. 320/- per unit. . Variable Overhead Costs = Rs.80/- per unit. 1 [Contd... KA-5589]The annual fixed cost associated with the unused capacity is Rs.4,00,099 dem the next year is estimated at 4000 units. oy A) Would it be profitable for the company to make the brakes, B) Suppose the capacity could be used by another department for the a some textile machinery equipment that would cover its fixed and Vay and contribute Rs.2,00,000 to profit. | ; ‘Which would be more advantageous brakes production or textile production? Neti lable machinery Chinn, 16 Maat OD op Q-3) Write short note on any two of the following: 16 Ma a) Material Planning in Push or Pull system. thy b) Objectives of Management Information System c) Integrated Material Management Approach 4) Just in Time Section II ; Q4) Product structure of an end product X is shown in figure given below: 18 Many x | B(1), LT=3 AG), LT=1 AG), LT=1 CQ),LT=2 BQ), LT=3 [pexiT=3 | | Dertr=3 | [xe.tT=1 | Determine requirements of various lower level items for producing 200 units of Also find the time schedule of the requirement of these items for delivering 200 Units of product X on day 10. Specially as to when an item is required and when an order for its production/procurement is to be placed and in what quantities. Q-5) Ina double sampling plan N = 6000, m Poission’s distribution to find the probability Assume that a lot rej = 100, C, = 0, np = 100 and C2 = 1. Use the of acceptance of a 1% defective lot. jected by this sampling plan will be 100% inspected, what will be the AOQ if the submitted product is 19 defeats Considering both the inspection of rejected lots, what will be the average number of articles inspected per lot if the submitted Product is 1% defective? 16 Marks OR Q-5) Following is the record of the defectives observed during the inspection process of an automatic machine producing small bolts of standard size, 16 Marks KA-5589] 2 [Contd...Q-6) Write short note on any two of the following: a) Functions of quality control. b) Total Quality Management c) Objectives of Management Information System d) Value Engineering and its functions. 16 Marks