×

Close

- Optimization in Engineering - OE
- 2018
- PYQ
**Biju Patnaik University of Technology BPUT - BPUT**- Civil Engineering
- B.Tech
**8875 Views**- 136 Offline Downloads
- Uploaded 1 year ago

Registration No : Total Number of Pages : 03 B.Tech. HSSM3302 6th Semester Back Examination 2017-18 OPTIMIZATION IN ENGINEERING BRANCH : AUTO, CIVIL, CSE, EEE, ELECTRICAL, ENV, FASHION, FAT, IT, ITE, MECH, METTA, MINERAL, MINING, MME, PLASTIC, TEXTILE Time : 3 Hours Max Marks : 70 Q.CODE : C274 Answer Question No.1 which is compulsory and any five from the rest. The figures in the right hand margin indicate marks. Q1. a) b) c) Answer the following questions : Define basic feasible solution, non degenerate basic feasible solution and degenerate basic feasible solution of a LPP. What is the difference between Canonical Form and Standard Form? Find Dual problem of the following Primal Problem. (2 x 10) = 7 +5 s.t. 4 + 2 ≤ 50 2 −4 ≤ 90 5 + 7 = 43 Where , ≥0 d) e) i) j) What is degeneracy in Transportation Problem? What is traffic intensity in a queuing system? If traffic intensity is 0.3, then what is the percent of time a system remains idle? Differentiate between Regular Simplex Method and Dual Simplex Method. What are Kuhn-Tukker conditions? What is the advantage of Golden search method over Fibonacci search method? Describe branch and bound method. Explain genetic algorithm. a) Solve the given LPP by Dual Simplex Algorithm. f) g) h) Q2. (5) = 2 + s.t. 3 + ≥3 4 + 3 ≥6 + 2 ≤3 Where , ≥0 b) A manufactures of cylindrical containers receives tin sheets in widths of 30cm and 60cm respectively. For these containers the sheets are to be cut to three different widths of 15cm, 21cm and 27cm respectively. The numbers of containers to be manufactured from these three widths are 400, 200 and 300 respectively. The bottom plates and top covers of the containers are purchased directly from the market. There is no limit on the lengths of standard tin sheets. Formulate the LPP for the production schedule that minimizes the trim losses. (5)

Q3. a) Find the optimal solution of the following transportation problem by VAM. Source/Destination S1 S2 S3 Demand b) Q5. D3 50 40 70 7 D4 10 60 20 14 Supply 7 9 18 D1 8 12 9 25 D2 10 9 11 32 D3 7 4 10 40 D4 6 7 8 23 (5) Supply 50 40 30 a) Solve the given LPP by II-Phase Method. = 5 +3 s. t. 2 + ≤ 1, + 4 ≥ 6, Where , ≥0 (5) b) Solve the given LPP by Revised Simplex Algorithm. = 6 + 12 s.t. + ≤ 20, 2 + ≤ 70, + 3 ≤ 40 Where , ≥0 (5) a) A person repairing radios finds that the time spent on the radio sets has exponential distribution with mean 20 minutes. If the radios are repaired in the order in which they come in and their arrival is approximately Poisson with an average rate of 15 for 8-hour/day, what is the repairman’s expected idle time each day? How many jobs are ahead of the average set just brought in? Solve the given NLPP by Golden Section Search Method. (5) b) min Q6. D2 30 30 8 8 Find the optimal solution of the following Transportation Problem by Stepping Stone Method. Source/Destination S1 S2 S3 Demand Q4. D1 19 70 40 5 (5) a) =4 + In interval [0, 3]. Solve the given NLPP by Lagrange’s Multiplier Method. = 5 + −( s. t. + =4 Where , ≥0 b) (5) − Solve the given NLPP by Kuhn-Tucker Conditions. Max = 2 + − s. t. 2 + 3 ≤ 6 2 + ≤4 Where , ≥0 (5) ) (5)

Q7. ( )=2 s.t. +4 + a) + 3 , ≤2 ≥0 (5) Solve the following assignment problem : Job/persons 1 2 3 4 5 b) − 2 ≤ 4, Where Q8. (10) Solve the following Quadratic Programming problem : A 15 1 8 14 10 B 10 8 9 10 8 C 25 10 17 25 25 D 25 20 20 27 27 E 10 2 10 15 12 Find the optimal solution to the following Integer Programming Problem. = − s. t. + 2 ≤ 4, 6 + 2 ≤ 9, Where , ≥ 0 and , . (5)

## Leave your Comments