PMO
Uploaded by
dil17PMO
Uploaded by
dil17University of Mumbai Class: B.E.
Branch: Instrumentation Semester - VII Engineering Elective-I : Process Modeling and Optimization (PMO) Periods per week Lectures 04 ( each of 60 minutes ) Practical 02 Tutorial --------Hours Marks Evaluation System Theory 03 100 Oral -----25 Term Work -----25 150 Total
Module No. 1. Contents Mathematical Modeling Use of mathematical models and principles of formulation, Fundamental laws: Continuity equations, Energy equation, Equations of motion, Chemical kinetics, Modeling of CSTR (isothermal, no-isothermal, constant holdup, variable holdup) Introduction to Optimization: Definition and meaning of optimization, need of optimization, conventional versus optimum design process, optimization problem formulation statement of an optimization problem, terminology, design vector, objective function, design constraints, constraint surface, Iteration, convergence, classification of optimization problem, engineering applications of optimization. Classical Optimization Techniques: Fundamental concepts- local and global minima, local and global maxima, quadratic form, necessary and sufficient condition of single and multivariable optimization with no constraints, multivariable optimization with equality and inequality constraints(Kuhn-Tucker condition), Lagrange Theorem. Linear Programming : Definition of linear programming problem (LPP), standard form of LPP, terminology, basic concepts, Simplex Algorithm and flowchart, simplex method, two-phase simplex method, Big-M method, Duality in LPP Numerical Methods for Unconstrained Optimum Design: General algorithm for constrained and unconstrained minimization methods, rate of convergence, unimodal and multimodal function ,reduction of a single variable, one dimensional minimization methods- Equal Interval method, Hours 08
2.
05
3.
10
12
4.
13
5.
22
Golden section search method, Polynomial Interpolation : Quadratic Interpolation method, Cubic Interpolation method, Gradient of a function, properties of gradient vector, Steepest Descent, Conjugate gradient (Fletcher-Reeves), Quasi-Newton method: Davidon-Fletcher-Powell, BroydenFletcherGoldfarb-Shanno.
Theory Examination:
1. 2. 3. 4. 5. 6. Question paper will consist of total 7 questions of 20 marks each. Only 5 questions need to be solved. Q.1 will be compulsory and based on the entire syllabus. Remaining questions will be mixed in nature. In question paper, weightage of each module will be proportional to the number of respective lecture hours as mentioned in the syllabus No question should be asked from the pre-requisite module
Oral Examination:
Oral examination will be based on entire subject.
Term work:
Term work consists of minimum ten assignments and a written test. The distribution of the term work shall be as follows, Laboratory work (Assignments and Journal) :15 marks Test (at least one) :10 marks The final certification and acceptance of term-work ensures the satisfactory performance of laboratory work and minimum passing in the term-work. Assignments: Each student shall do at least One assignment on Module No. 1, Two assignments on Module No. 2, Three Assignments on Module No. 3 and Four assignments on Module No. 4 and 5 each. For assignments on Module No. 5 use Optimization Toolbox of MATLAB. Text Books: 1) S. S. Rao, Optimization, 2nd edition New Age International (P) Ltd., Publishers, New Delhi, 1995. 2) Jasbir S. Arora, Introduction to Optimum Design, ELSEVIER, Academic Press, USA 2004. 3) T. E. Edger and D. M. Himmeblaue, Optimization of Chemical Processes, McGraw Hill International Editions, 1989. Reference Books: 1) Kalyanmoy Deb, Optimization For Engineering Design, Prentice Hall of India (P) Ltd., New Delhi, 1998. 2) Ashok D. Belegundu, Optimization concepts and applications in Engineering, Pearson Education, 2002. 3) Hamby A. Taha, Operation Research, Pearson education - 2007. 23
