Modeling and Optimization CHEN 4470 – Process Design Practice Dr. Mario Richard Eden Department of Chemical Engineering Auburn University Lecture No. 9.

Slides:



Advertisements
Similar presentations
Linear Programming Problem
Advertisements

Introduction to Mathematical Programming
Introduction to Mathematical Programming Matthew J. Liberatore John F. Connelly Chair in Management Professor, Decision and Information Technologies.
Lesson 08 Linear Programming
CHEN 4460 – Process Synthesis, Simulation and Optimization
Linear Programming Problem
CHEN 4460 – Process Synthesis, Simulation and Optimization Dr. Mario Richard Eden Department of Chemical Engineering Auburn University Lab Lecture No.
Learning Objectives for Section 5.3
Distillation Modeling CHEN 4470 – Process Design Practice
Managerial Decision Modeling with Spreadsheets
Chapter 2 Linear Programming Models: Graphical and Computer Methods © 2007 Pearson Education.
Chapter 8: Linear Programming
© 2014 Carl Lund, all rights reserved A First Course on Kinetics and Reaction Engineering Class 3.
19 Linear Programming CHAPTER
1 Lecture 12 Resource Allocation Part II (involving Continuous Variable (Linear Programming, continued) Samuel Labi and Fred Moavenzadeh Massachusetts.
CHEN 4460 – Process Synthesis, Simulation and Optimization Dr. Mario Richard Eden Department of Chemical Engineering Auburn University Lab Lecture No.
Modeling and Optimization CHEN 4470 – Process Design Practice Dr. Mario Richard Eden Department of Chemical Engineering Auburn University Lecture No. 9.
CHEN 4460 – Process Synthesis, Simulation and CHEN 4460 – Process Synthesis, Simulation and Optimization Dr. Mario Richard Eden Department of Chemical.
1 2TN – Linear Programming  Linear Programming. 2 Linear Programming Discussion  Requirements of a Linear Programming Problem  Formulate:  Determine:Graphical.
Separating Azeotropic Mixtures CHEN 4460 – Process Synthesis, Simulation and CHEN 4460 – Process Synthesis, Simulation and Optimization Dr. Mario Richard.
Integration of Design & Control CHEN 4470 – Process Design Practice
CHEN 4460 – Process Synthesis, Simulation and Optimization Dr. Mario Richard Eden Department of Chemical Engineering Auburn University Lab Lecture No.
Separating Azeotropic Mixtures CHEN 4460 – Process Synthesis, Simulation and Optimization Dr. Mario Richard Eden Department of Chemical Engineering Auburn.
CHEN 4460 – Process Synthesis, Simulation and Optimization Dr. Mario Richard Eden Department of Chemical Engineering Auburn University Review of Midterm.
Heat and Power Integration CHEN 4460 – Process Synthesis, Simulation and Optimization Dr. Mario Richard Eden Department of Chemical Engineering Auburn.
Property Prediction and CAMD CHEN 4470 – Process Design Practice Dr. Mario Richard Eden Department of Chemical Engineering Auburn University Lecture No.
Linear Programming Models: Graphical Methods 5/4/1435 (1-3 pm)noha hussein elkhidir.
CHEN 4470 – Process Design Practice Dr. Mario Richard Eden Department of Chemical Engineering Auburn University Lecture No. 14 – Design of Overhead Condensers.
Linear Programming Operations Research – Engineering and Math Management Sciences – Business Goals for this section  Modeling situations in a linear environment.
Linear Programming Models: Graphical and Computer Methods
Stevenson and Ozgur First Edition Introduction to Management Science with Spreadsheets McGraw-Hill/Irwin Copyright © 2007 by The McGraw-Hill Companies,
Chapter 2 Linear Programming Models: Graphical and Computer Methods
3.4 Linear Programming.
CHEN 4470 – Process Design Practice Dr. Mario Richard Eden Department of Chemical Engineering Auburn University Lecture No. 1 – Course Introduction and.
CHEN 4460 – Process Synthesis, Simulation and Optimization Dr. Mario Richard Eden Department of Chemical Engineering Auburn University Lab Lecture No.
Integration of Design & Control CHEN 4470 – Process Design Practice Dr. Mario Richard Eden Department of Chemical Engineering Auburn University Lecture.
Optimization Models Mathematical optimization models usually contain an objective (what to do) constraints (the rules that must be followed). Also referred.
Solution of a System of ODEs with POLYMATH and Excel, Parametric Studies with Excel The canonical form of a system of n simultaneous first-order ordinary.
© 2015 Carl Lund, all rights reserved A First Course on Kinetics and Reaction Engineering Class 31.
CHEN 4460 – Process Synthesis, Simulation and Optimization Dr. Mario Richard Eden Department of Chemical Engineering Auburn University Lab Lecture No.
Linear Programming Terminology. Contents 1.What is a Mathematical Model? 2.Illustration of LPP: Maximization Case 3.What.
Linear Programming – Simplex Method
Process Optimization By Dr : Mona Ossman.
Basic skill for ASPEN plus Liang Yu Department of Biological Systems Engineering Washington State University
Advanced Operations Research Models Instructor: Dr. A. Seifi Teaching Assistant: Golbarg Kazemi 1.
MA3264 Mathematical Modelling Lecture 9 Chapter 7 Discrete Optimization Modelling Continued.
CHEN 4470 – Process Design Practice Dr. Mario Richard Eden Department of Chemical Engineering Auburn University Lecture No. 2 – Contents of Reports January.
Monday WARM-UP: TrueFalseStatementCorrected Statement F 1. Constraints are conditions written as a system of equations Constraints are conditions written.
Chapter 2 Linear Programming Models: Graphical and Computer Methods
3.4: Linear Programming Objectives: Students will be able to… Use linear inequalities to optimize the value of some quantity To solve linear programming.
Managerial Economics Linear Programming Aalto University School of Science Department of Industrial Engineering and Management January 12 – 28, 2016 Dr.
LINEAR PROGRAMMING 3.4 Learning goals represent constraints by equations or inequalities, and by systems of equations and/or inequalities, and interpret.
Mass Integration CHEN 4470 – Process Design Practice
Business Mathematics MTH-367 Lecture 16. Chapter 11 The Simplex and Computer Solutions Methods continued.
Don Sutton Spring LP Basic Properties Objective Function – maximize/minimize profit/cost Resource Constraints – labor, money Decision.
Miscellaneous CHEN 4470 – Process Design Practice Dr. Mario Richard Eden Department of Chemical Engineering Auburn University Lecture No. 24 – End of Class.
Linear Programming McGraw-Hill/Irwin Copyright © 2012 by The McGraw-Hill Companies, Inc. All rights reserved.
Introduction Operations Research (OR) It is a scientific approach to determine the optimum (best) solution to a decision problem under the restriction.
Examples and Exercises
Chapter 2 Linear Programming Models: Graphical and Computer Methods
Operations Research Chapter one.
Purdue School of Engineering and Technology
Chapter 2 An Introduction to Linear Programming
Managerial Economics Linear Programming
Purdue School of Engineering and Technology
Linear Programming Problem
LINEARPROGRAMMING 4/26/2019 9:23 AM 4/26/2019 9:23 AM 1.
Module B Linear Programming.
Process Modeling using Aspen Plus
Miscellaneous CHEN 4470 – Process Design Practice
Presentation transcript:

Modeling and Optimization CHEN 4470 – Process Design Practice Dr. Mario Richard Eden Department of Chemical Engineering Auburn University Lecture No. 9 – Modeling Reactive Systems and Mathematical Optimization February 7, 2006

Background Material –Multimedia software –Documents placed on webpage Rate-controlled reactions from Aspen Help Workshop document on reactive systems Kinetic Reactors in Aspen 1:5

Example – Ethylbenzene Production –Feed stream conditions Benzene120 lbmol/hr Ethylene100 lbmol/hr Toluene 5 lbmol/hr Temperature400  C Pressure20 atm –Reactor specifications Reactions and kinetics as given in project description Reactor specified as adiabatic with a 5 psi pressure drop Reactor length:100 ft Reactor diameter 10 ft Kinetic Reactors in Aspen 2:5

Example – Ethylbenzene Production (Cont’d) –Components renamed from Aspen standards Kinetic Reactors in Aspen 3:5

Example – Ethylbenzene Production (Cont’d) –Reaction set defined as “Powerlaw” Kinetic Reactors in Aspen 4:5 Click here to specify the kinetics

Example – Ethylbenzene Production (Cont’d) Kinetic Reactors in Aspen 5:5 IMPORTANT Must be specified in SI units, see document on website or Aspen help

Optimization Example 1 1:7

Optimization Example 1 2:7 Solution –Objective is to maximize profit by identifying production rates of three types of bread –Define variables A: Number of 1 kg loaves produced of bread type A B: Number of 1 kg loaves produced of bread type B C: Number of 1 kg loaves produced of bread type C –Define profit function Profit A = Sales revenue of Type A – Cost of producing A Profit B = Sales revenue of Type B – Cost of producing B Profit C = Sales revenue of Type C – Cost of producing C Total Profit J = Profit A + Profit B + Profit C

Optimization Example 1 3:7 Solution (Continued) –Using the information given in the problem statement, we can define the individual profits as: Profit A = ($5 – 0.40*$1– 0.30*$1.5 – 0.30*$2)*A = 3.55A Profit B = ($3.5 – 0.50*$1– 0.50*$1.5)*B = 2.25B Profit C = ($2 – 1*$1)*C = C

Optimization Example 1 4:7 Solution (Continued) –The hint given in the problem statement suggest to reformulate the equations to be functions of A and B. From equation (2) we can obtain an expression for C: (2a) C = 1000 – A – B (2b)A + B  1000 –Substituting equation (2a) into equation (1) gives: max J = 3.55A B – A – B  (1a)max J = A B

Optimization Example 1 5:7 Solution (Continued) –Analagously, we can substitute equation (2a) into equation (3) to obtain a revised constraint: 0.40A B – A – B  700  1000 – 0.60A – 0.50B  700  – 0.60A – 0.50B  – 300  (3a)0.60A B  300

Optimization Example 1 6:7 Solution (Continued) –This gives the revised optimization problem: –We are now able to plot the constraints.

Optimization Example 1 7:7 Solution (Continued) The optimal solution to a LP lies on a vertex of the feasibility region, i.e. Point 1,2 or 3. (A,B) = (0, 600) J = $1,750 (A,B) = (500, 300) J = $2,650 (A,B) = (500, 0) J = $2,275 Optimal solution: A = 500, B = 300, C = 200 J = $2,650

Optimization Example 2 1:4

Optimization Example 2 2:4 Solution –Objective is to minimize daily inspection cost by allocation of inspection teams –Define variables X: Number of type 1 inspection teams Y: Number of type 2 inspection teams Z: Number of type 3 inspection teams –Define inspection cost Cost A = Wages for Type 1 + Cost of Errors by Type 1 Cost B = Wages for Type 2 + Cost of Errors by Type 2 Cost C = Wages for Type 3 + Cost of Errors by Type 3 Total Cost J = X*Cost A + Y*Cost B + Z*Cost C

Optimization Example 2 3:4 Solution (Continued) –Using the information given in the problem statement, we can define the individual inspection cost and inspection rates as follows: Cost A = $30/hr + (1 – 0.95)*30 m 2 /hr*$25/m 2 = $67.5/hr Cost B = $20/hr + (1 – 0.90)*35 m 2 /hr*$25/m 2 = $107.5/hr Cost C = $15/hr + (1 – 0.85)*50 m 2 /hr*$25/m 2 = $202.5/hr Inspection rate Type 1: 30 m 2 /hr * 12 hr/shift = 360 m 2 /shift Inspection rate Type 2: 35 m 2 /hr * 12 hr/shift = 420 m 2 /shift Inspection rate Type 3: 50 m 2 /hr * 12 hr/shift = 600 m 2 /shift

Optimization Example 2 4:4 Solution (Continued) –Now we can formulate the optimization problem

Next Lecture – February 14 –Physical property prediction –Computer aided molecular design No Class or Meetings on February 9 –Medical Exam in Montgomery –Will be out of town February 10 –Progress report no. 1 can be turned in to my mailbox by 4:00 PM on Friday Other Business