Process Optimization - 01
Process Optimization - 01
OFFICE: 04-03-31
TELP: 05 368 7562
EMAIL: [email protected]
1
Contents
1. Definition
2. Problem formulation
3. Degrees of Freedom (DOF)
2
Design and operating variable
Design & operating variable is a trade-off Optimum value
3
Types of variables
Discrete (e.g. integer) - can only take discrete values, e.g. no.of
reactors, no.of columns in a sequence, no. of trays in a column, ...
Binary variables - can only take 0 or 1, e.g. such equipment
exists or does not exist, ...
4
Objective function
Other resources:
- Fuel (e.g. for energy)
- Water (e.g. for wash)
- Solvents
Investment
(Capital Expenditure or CAPEX) By products
Waste
Wastewater
Objective function = f(product, raw materials, energy, water, solvents, equipment design,
waste, etc.)
A = 1 mol/hr
Reactor Distillation
B = 1 mol/hr
6
Example
Given:
T s = 25 oC
w Cps, Cpw = Specific heat capacities
Fw = ? C = unit cost of water
o
Cpw = 4.2 kJ/kg C U = overall heat transfer coefficient, 1000
Ts = 170OC Tt = 80 oC W/(m2.oC)
A R = annualisation factor
s A= ? Q =? Exchanger capital cost ($) = a A0.84
F = 500 kg/hr
Cps =1kJ/kgOC
t Subscript: w = tube; s = shell side
Tw = ?
Superscript : s = supply temperature;
t = target temperature
7
A COMPLETE PROCESS MODEL
In general, a mathematical programming model or process model
can be expressed in the following format:
minimise f(x) - objective function
Or maximise
Subject to:
8
A COMPLETE PROCESS MODEL
Minimize f = R(aA0.84) + CFw Objective function
Subject to:
H1: Q FsCps(Ts-Tt) = 0
H2: Q FwCpw(Ttw-Tsw) = 0 Equality constraints
H3: Q UA(Tt-Tsw) (Ts-Ttw) / ln{(Tt-Tsw)/ (Ts-Ttw)}
9
NOTES
if f(x), g(x) and h(x) are all linear, then this is a linear programming problem (LP).
If some variables are integer, then it is either mixed integer linear programming
problem (MILP) or mixed integer non-linear programming problem (MINLP).
10
6 Steps to Solve Optimization Problem
11
Degrees of Freedom (DOF)
Example
Minimise f = x2 x1 + 2x32 - 4x4x5
Subject to
x3 - 2x1 + x2 = 2
x4 + x1 - 3x2 = 2
x5 + x1 + x2 = 4
12
Rearrange the constraints:
x3 = 2 + 2x1 - x2
x4 = 2 + 3x2 - x1
x 5 = 4 - x1 - x2
13
For some values of x1 and x2, f can achieve a minimum, determined by optimisation
In general
DOF = NV - NE
14
Questions
1. What is DOF if one more equation is added without adding new
variables to our example?
2. How about adding two more equations without introducing new variables?
Is it still an optimisation problem?
3. What happens if more than two equations are added to the example,
without adding new variables?
15
Quiz
Heavy naphtha Catalytic Gasoline high octane
(A) Reforming (E)
Residue Gasoline
Hydrocracking
(C) (G)
16