Process Integration and Optimization - Lecture One
Process Integration and Optimization - Lecture One
optimization
Lecture one: Introduction to Optimization
Process model
Process Mathematical presentation
For example, the catalyst may operate effectively only below 400°C, or
below 20 MPa.
Inequality constraints reduce (and often bound) the search space of the
decision variables.
An objective function is a mathematical function that, for the best values
of the decision variables, reaches a minimum (or a maximum). Thus, the
objective function is the measure of value or goodness for the optimization
problem.
If it is a profit, one searches for its maximum.
If it is a cost, one searches for its minimum.
There may be more than one objective function for a given optimization
problem.
Maximum profit
Minimum cost
Minimum effort
Minimum error
Minimum waste
Maximum throughput
Best product quality
Note the need to express the performance criterion in mathematical form.
Addis Ababa University
School of Chemical and Bio Engineering Shimelis Kebede (Ph.D.)
AAiT
Optimisation
Minimum: A point where the objective function does not decrease when
the variable(s) are changed some amount.
Maximum: A point where the objective function does not increase when
the variable(s) are changed some amount.
A chemical plant makes urea and ammonium nitrate. The net profits are
$1000 and $1500/ton produced respectively. Both chemicals are made in
two steps – reaction and drying. The number of hours necessary for each
product is given below:
Reaction 4 2
Drying 2 5
The reaction step is available for a total of 80 hours per week and the
drying step is available for 60 hours per week.
There are 75 tons of raw material available. Each ton produced of either
product requires 4 tons of raw material.
What is the production rate of each chemical that will maximize the net
profit of the plant?
Objective Function:
We want to maximize the net profit. Net Profit = Revenue – Cost. Let x 1 = tons
of urea produced per week & x2 = tons of ammonium nitrate produced per week.
Revenue = 1000x1 + 1500x2. There is no data given for costs, so assume Cost =
0.
Constraints:
We are given that the reaction step is available for 80 hrs/week. So, the
combined reaction times required for each product cannot exceed this
amount.
The table says the each ton of urea produced requires 4 hours of reaction
and each ton of ammonium nitrate produced requires 2 hours of reaction.
This gives the constraint:
4x1 + 2x2 ≤ 80
Addis Ababa University
School of Chemical and Bio Engineering Shimelis Kebede (Ph.D.)
AAiT
Cont…
We are also given that the drying step is available for 60 hrs/wk. The table
says that urea requires 2 hrs/ton produced and ammonium nitrate requires
5 hrs/ton produced. So, we end up with the following constraint:
2x1 + 5x2 ≤ 60
We are given that the supply of raw material is 75 tons/week and each ton
of urea or ammonium nitrate produced requires 4 tons of raw material.
This gives our final constraint:
4x1 + 4x2 ≤ 75
x1 ≥ 0 & x2 ≥ 0
The grey area is called the feasible region and you can see that the optimum
point is at the intersections of constraints 2 & 3.
Since we are maximizing, we went in the direction of the profit vector
A company has three plants that produce ethanol and four customers they
must deliver ethanol to. The following table gives the delivery costs per
ton of ethanol from the plants to the customers.
(A dash in the table indicates that a certain plant cannot deliver to a
certain customer.)
Plant/Customer C1 C2 C3 C4
P1 132 - 97 103
P2 84 91 - -
P3 106 89 100 98
The three plants P1, P2, & P3 produce 135, 56, and 93 tons/year,
respectively. The four customers, C1, C2, C3, & C4 require 62, 83, 39,
and 91 tons/year, respectively.
Determine the transportation scheme that will result in the lowest cost.
Objective Function:
We want to get the lowest cost, so we want to minimize the cost. The cost
will be the costs given in the table times the amount transferred from each
plant to each customer. Many of the amounts will be zero, but we must
include them all because we don’t know which ones we will use.
Minimize 132 x11 + 97 x13 + 103 x14 + 84 x21 + 91 x22 + 106 x31 + 89 x32 +
100 x33 + 98 x34.
Constraints:
The ethanol plants cannot produce more ethanol than their capacity limitations.
The ethanol each plant produces is the sum of the ethanol it sends to the
customers. So, for plant P1, the limit is 135 tons/year and the constraint is:
For plants P2 & P3, the limits are 56 and 93 tons/year, so their constraints
are:
x21 + x22 ≤ 56
x31 + x32 + x33 + x34 ≤ 93
The ≤ sign is used because the plants may produce less than or even up to
their limits, but they cannot produce more than the limit.
Also, each of the customers have ethanol requirements that must be met.
For example, customer C1 must receive at least 62 tons/year from either
plant P1, P2, P3, or a combination of the three. So, the customer constraint
for C1 is:
Since it can receive ethanol from plants P1, P2, & P3.
The requirements for customers C2, C3, & C4 are 83, 39, & 91 tons/year so their
constraints are:
x22 + x32 ≥ 83
x13 + x33 ≥ 39
x14 + x34 ≥ 91
The ≥ sign is used because it’s alright if the customers receive extra ethanol, but
they must receive at least their minimum requirements.
Addis Ababa University
School of Chemical and Bio Engineering Shimelis Kebede (Ph.D.)
AAiT
Cont..
If the customers had to receive exactly their specified amount of ethanol,
we would use equality constraints
However, that is not stated for this problem, so we will leave them as
inequality constraints
0 39 87 56 0 6 83 0 4
Continuous optimization
Multi-objective optimization
Deterministic optimization
Stochastic optimization