Explain the meaning of following terms for optimization: Feasible solution, feasible region, optimal solution.
[3 marks]Describe the major obstacles to optimization problem.
[4 marks]List the six general steps for the analysis and solution of optimization problem.
[7 marks]Explain various applications of modelling and simulation.
[3 marks]Abox with a square base and open top is to hold 1000 cm3. Find the dimensions that require the least material (assume uniform thickness of material) to construct the box.
[4 marks]Discuss the optimizing recovery of waste heat with suitable figure and equations.
[7 marks]Explain the features of Basic Tearing Algorithm.
[7 marks]Explain equation solving approach in brief.
[3 marks]Explain white box model.
[4 marks]Develop batch reactor model.
[7 marks]Explain the importance of degree of freedom in model building.
[3 marks]Differentiate between steady state and dynamic simulation.
[4 marks]What is sequential modular approach in simulation? Explain the step with diagram.
[7 marks]Explain the uses of mathematical models.
[3 marks]Explain the penalty methods for solving nonlinear programming with constraints.
[4 marks]Develop the equations for the series of isothermal, variable holdup CSTRs. List all the assumptions with their justifications.
[7 marks]Explain simplex search method.
[3 marks]Determine positive-definiteness of a function f(x) = 2x2 −3x x + 2x2.
[4 marks]Explain in brief how one-dimensional search is applied in a multidimensional problem.1
[7 marks]Explain Lagrange multiplier method.
[3 marks]Explain the necessary and sufficient conditions for an extremum of an unconstrained function.
[4 marks]Minimize function f(x) =x4−x+1 using Newton’s method for starting point of x = 3 show five iterations.
[7 marks]Minimize the quadratic function f(x) = x2−x using finite difference newton method start with x = 3 and h = 0.001.
[3 marks]Write a short note on decomposition of networks.
[4 marks]Solve the following linear programming problem using simplex method Maximize Z = 6x + 5 x12 Subject to x + x ≤ 512 3x + 2x ≤12 x ,x ≥
[12 marks]