List the applications of optimization in chemical process engineering.
[3 marks]List out various professional process simulator and explain any one in brief.
[4 marks]Discuss essential feature of optimization problem.
[7 marks]Compare lumped parameter model and distributed parameter model.
[3 marks]Aposter is to contain 300 cm2 of printed matter with margins of 6cm at the top and bottom and 4cm at each side. Find the overall dimensions that minimize the total area of the poster.
[4 marks]Explain basic tearing algorithm.
[7 marks]For the digraph given below:
[7 marks]Develop a signal flow graph. ii) Find the streams that are to be teared (i.e. cut set) using Kehat and Shacham Algorithm.
[ marks]Define: simulation, optimization and modelling.
[3 marks]Explain partitioning with suitable example.
[4 marks]Describe classification of mathematical modelling based on state of the process.
[7 marks]Define continuity of function and convexity.
[3 marks]Explain importance of modelling for simulation and optimization.
[4 marks]Explain Simultaneous modular approach in simulation.
[7 marks]Explain black box model.
[3 marks]Explain Lagrange multiplier and the Kuhn-Tucker conditions.
[4 marks]Determine the mathematical model for isothermal CSTR with constant hold- up.
[7 marks]Show the advantages and disadvantages of Newton’s method.
[3 marks]Determine the Hessian matrix of the function f(x) = 2x2 − 3x x + 2x2
[4 marks]List the methods for unconstrained multivariable optimization problems. Explain any one in brief.1
[7 marks]Minimize the function f(x) =x2−x using quadratic interpolation three point bracketing the minimum (-1.7,-0.1, 1.5) are used to start the search for the minimum of f(x).
[3 marks]List the various equations of chemical kinetics used in process modelling.
[4 marks]Minimize function f(x) =x4−x+1 using Newton’s method for starting point x=3 show five iterations.
[7 marks]Minimize the quadratic function f(x) =x2−x using quasi Newton method start with x= -3 and x= 3.
[3 marks]Discuss the degree of freedom analysis with suitable example.
[4 marks]Solve the following linear programming problem using simplex method Maximize Z= 12 x + 16 x12 Subject to 10 x + 20 x ≤ 12012 8 x + 8 x ≤ 8012 x ,x ≥
[12 marks]