Time: Note: a) b) ° d a) b) 4. b) IE) Roll No B.TECH (SEM VIII) THEORY EXAMINATION 2017-18 OPTIMIZATION TECHNIQUES IN CHEMICAL ENGINEERING 3 Hours Total Marks: 100 1. Attempt all Sections. If require any missing data; then choose suitably, 2. Any special paper specific instruction. SECTION A Attempt all questions in brief. 2x10=20 Enumerate few enginteering applications of optimization. Define Dichotomous. Define dynamic programming ‘What do you mean by convex function? Define the saddle point, What is the significance of Lagrange multipliers? Discuss about unconstrained optimization problems. Define artificial variables. Define duality problem. ‘What is golden section? SECTION B Attempt any three of the follo 10x3=30 Enumerate the scope and limitations of-oftinization techniques. Explain all direct methods for solving KPP. Describe the Newton’s method to-fad an optimality of a function of one variable. Find the minimum of f(x) = gQ1.5) in the interval (0,1) within 10% of the exact value and 8 = 0.001 Describe the gradient method for determining the search direction of first order systems. Attempt any one part of the following: 10x1=10 Find the volume of largest rectangular solid inscribed in the ellipsoid. (22) + (y2)4( 22) =1 Explain the secant method of uni-dimensional search, Attempt any one part of the following: 10x1=10 Explain finite difference approximation with example. The total annual cost of a pump and motor (C) in a particular piece of equipment is a function of x , the size of the motor in horsepower, namely C=$500+$0.9x+$0.3 (150000)x Find the motor size that minimizes the total annual cost. www.pooripadhai.com5. Attempt any one part of the following: 10x1=10 (a) Find the minimum of the fumetion PE 0.65x tant Fix) = 0.65 Using Newton-Raphson method with the starting point x= 0.1. Use € = 0.01 for checking the convergence. (b) What are the various direct and indirect methods of multivariable search? Discuss any one of them, 6. Attempt any one part of the following: 10x1=10 a) Describe the gradient method for determining the search direction of first order systems. b) Describe Fibonacci search method for a unimodel function of a single variable. Find the maximum and minimum values of the function fix) = 12x5— 45x4 + 40x° + 5. Attempt any one part of the following: 10x1=10 8) Describe the Optimal solution and optimal basie solution in detail 'b) Solve the following LPP graphically, Minimize f= 3x1+x2 Subjectto. x1 +> 8 2x +026 x +3026 xi+6u28 x20, 0.20. www.pooripadhai.com