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
- 19429 Views
- 281 Offline Downloads
- Uploaded 1 year ago
Text from page-1
Registration No : Total Number of Pages : 03 B.Tech. PCI4D003 4th Semester Regular / Back Examination 2017-18 OPTIMIZATION IN CIVIL ENGINEERING BRANCH : CIVIL Time : 3 Hours Max Marks : 100 Q.CODE : C1143 Answer Part-A which is compulsory and any four from Part-B. The figures in the right hand margin indicate marks. Answer all parts of a question at a place. Part – A (Answer all the questions) Answer the following questions : multiple type or dash fill up type : Q1 a) b) c) d) e) f) g) h) i) j) Operations research, which is a very powerful tool for _____________. (i) Research (ii) Decision Making (iii) Operations (iv) None of the above A basic solution is said to be __________ if any one of the basic variables vanishes. If a constraint is of less than type then _____________ variable is used to make it equality type. _____________ method is better method to find out initial basic feasible solution. The Hungarian method for solving an assignment problem can also be used to solve. (i) Transportation Problem, (ii) Travelling Salesman Problem, (iii) Both (i) and (ii) The objective functions and constraints are linear relationship between ________ (i) Variables (ii) Constraints (iii) Functions Two applications of Dynamic Programming Problems are _____ . Which of the following is not the valid objective function for nonlinear programming problem? (i) Max z = 2x+3y (ii) Min z = 3x+10xy+4y2 (iii) Max z =6 x -2xy2 + 3x2 Types of integer programming problems are _______________________. Which of the following parameters is not required to use the Golden Section Search method for optimization? (i) The lower bound for the search region (ii) The upper bound for the search region (iii) The golden ratio (iv) The function to be optimized (2 x 10)
Text from page-2
Q2 Answer the following questions : Short answer type : a) Differentiate between Cannonical Form and Standard Form. b) Find Dual problem of the following Primal Problem = 7 +5 s.t. 4 + 2 ≤ 50 2 − 4 ≤ 90 5 + 7 = 43 Where , ≥0 c) d) e) What is degeneracy in Transportation Problem? f) g) h) i) What are the advantages & disadvantages of Fibonacci Search Method and Golden Search Method? Briefly describe Dynamic Programming Problem. What is quadratic programming? Explain branch and bound method. j) Define Genetic Algorithm. (2 x 10) Explain the Non Linear Programming Problem. Describe K-T conditions. Part – B (Answer any four questions) Q3 a) b) Q4 a) b) Solve the given LPP by Big M Method. = +2 s. t. + 3 ≤ 30, 2 + ≤ 20, + = 10, Where , ≥0 Formulate the problem as a L.P.P.. A firm manufactures three products A, B, C. Time to manufacture product A is twice that for B and thrice that for C and if the entire labour is engaged in making product A, 2400 units of this product can be produced. These products are to be produced in the ratio 4 : 2: 3. There is demand for at least 260, 310 and 240 units of products A, B and C and profit earned per unit is Rs. 80/-, Rs. 30/- and Rs. 50/- respectively. (10) Find the optimal solution of the following Transportation Problem by MODI Method. (10) 22 20 23 30 34 19 21 40 24 32 14 90 10 80 70 Solve the following assignment problem. (5) (5) 12 19 9 17 11 17 15 13 10 15 13 12 17 12 18 16
Text from page-3
Q5 Q6 Q7 a) Find the optimal solution to the following Integer Programming Problem. = 2 +5 s. t. + 2 ≤ 4, 6 + 2 ≤ 9, Where , ≥ 0 and , . (10) b) Describe recursive equation approach to solve Dynamic programming problem. (5) a) Use dynamic programming to solve the following problem : = + + s.t. + + ≤ 10 Where , , ≥0 (10) b) Describe dynamic programming as an approach for optimizing multistage decision process. (5) a) Minimize ( ) = . b) Q8 a) . − . ( / ) in interval [0,3] By the Fibonacci Method using n=6. Solve the given NLPP by Kuhn-Tucker Conditions. = 6 +7 −5 s.t. + 2 ≤ 10 −3 ≤9 Where , ≥0 =2 +3 − − , s. t. + ≤ 2, Where (10) (5) (10) Solve the given Quadratic programming problem Max Q9 − , ≥0 b) Describe different operations of Genetic Algorithm. (5) a) Solve following problem Min Z = 25( − 3 ) + ( − 3) , s. t. + 2 = 9 using projected gradiant method. Difference and similarities between Genetic Algorithm and Traditional Methods. (10) b) (5)
Leave your Comments