List the various professional simulators and equation solver software.
[3 marks]Find out stationary points using Lagrange Multiplier method for following function : Minimize f(x)= 4x 2 + 5x 212 Subject to h(x) = 2x + 3x – 6 =012
[4 marks]Discuss the six steps used to solve optimization problems.
[7 marks]Write the various equations of motion for process modeling.
[3 marks]Describe briefly the fundamental laws used in mathematical models of chemical engineering systems.
[4 marks]Explain: partitioning, tearing, Sequential modular approach, simultaneous modular approach.
[7 marks]Explain the features of Basic Tearing Algorithm.
[7 marks]Compare lumped parameter model and distributed parameter model.
[3 marks]It is required to design a close-topped rectangular tank whose total area is to be 110 m2. If a maximum volume is required then formulate the problem.
[4 marks]Define mathematical modeling and give detail classification of mathematical modeling.
[7 marks]Compare linear model and non linear model.
[3 marks]Achild’s rectangular play yard is to be built next to the house. To make the three sides of the play yard, 24 feet of fencing are available. Formulate the problem to maximize the area of play yard.
[4 marks]Explain: black-box model, white box model, gray model.
[7 marks]Determine the Hessian matrix of the function f(x) = 2x – 3x x + 2x 2122
[3 marks]Explain the necessary and sufficient conditions for an extremum of an unconstrained function.
[4 marks]Explain mathematical modeling of non-isothermal CSTR.
[7 marks]Define : feasible region, global minimum, convex region
[3 marks]Construct the region given by the following inequality constraints and determine its convexity. x ≤ 6 ; x ≤6 ; x +x ≤6 ; x ≥ 0, x ≥ 0
[4 marks]Explain mathematical modeling of ideal binary distillation column.1
[7 marks]Classify the methods for unconstrained multivariable optimization problems.
[3 marks]List the applications of optimization in chemical engineering.
[4 marks]Minimize f(x) = x4 – x + 1 using Newton’s method. Take any suitable initial guess. Show at least 4 iterations.
[7 marks]Explain the penalty methods for solving nonlinear programming with constraints.
[3 marks]Explain Simplex algorithm for linear programming.
[4 marks]Discuss the optimizing recovery of waster heat with suitable figure and equations.
[7 marks]