×
Listen to your teachers when they tell you WHAT to do. But more importantly, think about it later and ask yourself WHY they told you to do it.
--Your friends at LectureNotes
Close

Previous Year Exam Questions for Optimization in Engineering - OE of 2018 - CEC by Bput Toppers

  • Optimization in Engineering - OE
  • 2018
  • PYQ
  • Biju Patnaik University of Technology Rourkela Odisha - BPUT
  • Civil Engineering
  • B.Tech
  • 9810 Views
  • 154 Offline Downloads
  • Uploaded 1 year ago
0 User(s)
Download PDFOrder Printed Copy

Share it with your friends

Leave your Comments

Text from page-2

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)

Text from page-3

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)

Lecture Notes