You are on page 1of 8
Retest: In Semester Examination-I Date: 01/10/2022, Duration: 120 minutes Maximum Marks: 26 0 v0 4e V/” DAsICY Gandhinagar VA 18402, Autuinn 2022-2023 General Instructions 2,6 a mtr © Answer all questions, gee ‘= Use of Calculator is NOT allowed. 7 an + Kindly ensure that no relevant books and notes are open during the exam duration, 1. A company is manufacturing 2 products: Preduct-A and Product-B. Consider that manufac- turing each unit of Product-A requires 10 minutes of Machine-1, 15 minutes of Machine-2, and 6 minutes of Machine-3. On the other hand, manufacturing each unit of Product-B requires 20 minutes of Machine-1, 12 minutes of Machine-2, and 8 minutes of Machine-3. The maximum availability of Machine-1, Machine-2 and Machine-3 are 800 minutes, 750 minutes and 480 minutes respectively. The profit per unit of Product-A and Product-B are US Dollar (USD) 20 and USD 17 respectively. (a) Formulate the LPP from the details available above for manufacturing both the products at the manufacturing facility. [2 marks] (b) Solve the formulated LPP using the Algebraic method listing all the cases and their so- lution. Obtain the optiinal value of the LPP, i.e, the objective function and the decision variables. [4 marks] wi 2. For the LPP: Mat Z =|\521 + 252 a st. tre) rntdn ssa Cou) © 3 az+6a2 $72 CON) ou ) a Se im y Bry +522 545 (CO! v G OL, es 7 ty, Ze Vb 44 21,42,23 > 0. (a) Solve the LPP stepwise and present the optimal solution using the Two-Phase method using a Maximization objective function in Phase-1. [8 marks] (b) Comment on the Nature of the obtained solution and the degeneracy /non-legeneracy of ‘yy qa) the solution. [2 marks] % > 3. MediaTek in US is manufacturing 2 processors Helio G95 and Helio G90 at its production facility in Austin and Irvine. 5 oo) y a %, ‘ by aos 2 MK e ies e “x \% wv 6 eK ? “a vc) ab. we xe a Hy a “oem ce? ie v Ke : Ota 3 “A . ns we v IE402: Optimization _Re-Test End Semester Examination - Page 2 of 2 24/12/2022 MediaTek Austin: Manufacturing each unit of:G95 requires 6 hours of Design Engineer (DE), 7 hours of Validation Engineer (VE) and 35 units of Silicon wafer material (SWM). While manufacturing each unit of G90 requires 4 hours of DE, 5 hours of VE and 50 units of SWM. The inaximum availability of DE, VE and SWM are 120 hours, 105 hours and 700 units respectively. The profit associated with each unit of G95 and G0 are USD 12 and USD 15 respectively. MediaTek Irviné: Manufacturing each unit of G95 requires 7 hours of DE, 6 hours of VE and 30 units of SWM. While manufacturing each unit of G90 requires 6 hours of DE, 4 hours of VE and 60 units of SWM. The maximum availability of DE, VE and SWM are 126 hours, 108 hours and 780 units respectively. The profit associated with each unit of G95 and G90 are USD 13 and USD 16 respectively. (a) Using the data available for Manufacturing the processors at MediaTek Austin and Medi- aTek Irvine, formulate it as an LPP for both the manufacturing sites. (4 marks] (b) Solve the formulated LPPs using any method of your choice and illustrate with reasoning that which Manufacturing facility of MediaTek is yielding a better profitable business.[10 marks} 4. (a) For m= 4 constraints and n = 6 decision variables LPP, derive the mathematical formu- lation for the Algebraic method illustrating the expressions of the objective funetion and the list of constraints. Obtain the mathematical model explicitly in terms of Matrices and Vectors by clearly representing them. [3 marks] (v) Consider a transportation model with m = 4 sources and n = 5 destinations. Derive the mathematical model (comprising the expressions of the objective function and the constraints) of the transportation problem and the Dual transportation problem. Deduce the obtained models for both by representing them in terms of Matrices and Vectors. [5 4 marks] we 5. For the LPP: Mor Z = 150) +322 2) st. geet? “3 321 +2242) =13 et 4 21 +219 - 2x4 =6 Sete 2x, — 22-252 Ue > 0Vi . (a) Solve the above LPP using the Graphical method by presenting the Feasible region ob- tained and the optimal solution. [4 marks] ” (b) Determine and list all the cases with Basic and Non-basie variables for the above LPP. Present the solution values for all the cases (listing out complete solution for cases with Basic Infeasible solution can be ignored). [5 marks] (©) Mlustrate the correspondence between the Corner points anil the Basic Feasible solution mentioning, the degeneracy /non-degeneracy of the Basic Feasible solution. [1 marks] oN wt tee wh *y (2 36 % NS Se (Paw, t 3 3 os ‘AV 2 am? ie % "4

You might also like