Modeling and Optimization of Polymerization Reactors
Modeling and Optimization of Polymerization Reactors
POLYMERIZATION REACTORS
SUBMITTED BY:
FIAZ AHMED TAHIR
(2002-POLY-1062)
MOHSIN ABBAS
(2002-POLY-1052)
SUBMITTED TO:
DR.JAVED RABBANI KHAN
DEPARTMENT OF CHEMICAL ENGINEERING
UNIVERSITY OF ENGINEERING & TECHNOLOGY
LAHORE.
Preface
Materials are more than mere components in technology; rather, the basic properties of
materials frequently define the capabilities, potential, reliability, and limitations of
technology itself. Improved materials and processes will play an ever increasing role in
efforts to improve energy efficiency, promote environmental protection, develop an
information infrastructure, and provide modern and reliable transportation and civil
infrastructure systems. Advances in materials science and engineering, therefore, enable
progress across and broad range of scientific disciplines and technological areas with
dramatic impacts on society.
Among these materials which have grown tremendously during last few decades are
synthetic polymers. Today, polymers are found in a large variety of products e.g.,
automobiles, paints, and clothing, to name a few. Polymers have replaced metals in many
instances, and with the development of polymers alloys, applications in specialty areas
are certain grow. The new and highly specialized application of polymers, along with the
trend toward totally quality management and global competitiveness, has served to drive
up the quality expectations of the customer. These developments make it imperative to
operate the polymerization processes efficiently, which underscores the importance of
modeling and optimization of polymerization reactors.
In a polymerization reactor, raw materials are mixed at specified operating
conditions to produce polymer(s) having desired properties. The end-use properties of
interest include color, viscoelasticity , thermal properties, and mechanical properties
among others. To produce a polymer with such desired properties means that process
variables such as temperature, molecular weight, molecular weight distribution must be
tightly controlled. The manipulated variables available for controlling the variables of
interest at setpoints include the flow rates of raw materials and catalyst, temperature of
feed streams and temperature, and/or flow rated of heating/cooling mediums. Thus
mathematical modeling of polymerization reactors which relate molecular weight and
molecular weight distribution of polymers with manipulated variables is very important.
Being undergraduate students of polymer engineering we cant model and optimize
the polymerization reactors in details because it is very difficult to model and optimize
the polymerization reactors specially on this level.
Now here is brief overview of our project.
We begin in chapter 1 with a brief overview of modeling, optimization, polymerization
techniques and polymerization reactors.
In chapter 2, we started with brief concepts of NACL, WACL, NAMW, WAMW and
MWD. We followed this with the discussion of chemistry and kinetics of various
polymerization reactions.
Chapter 3 gives the details of modeling, how to build a model, use of modeling, modeling
principles and how to model a polymerization reactor.
Chapter 4 is devoted to optimization in which we define objective function, variables,
constraints, mathematical relationships between these, definition of optimization
problems and optimization solution methodologies.
2
In Chapter 5 we shifted our attention from chemistry and kinetics of polymerization to
modeling of batch polymerization reactors. We developed models for anionic, free
radical and step growth polymerization and solved these using MATLAB programming.
Chapter 6 throw light on modeling of continuous stirred tank polymerization reactors.
The techniques used were anionic, free radical and step growth polymerization. Then we
solved these using MATLAB.
Chapter 7 is about optimization of polymerization reactors. First we have discussed what
is multi objective optimization and then we have written multi objective optimization of
polyester reactor.
We thank the Department of chemical engineering UET Lahore for their support in
this endeavor.
We pay special homage to our respective teacher Dr. Javed Rabbani Khan, who really
paid their special attention in completion of our project.
FIAZ AHMED TAHIR
MOHSIN ABBAS
3
TABLE OF CONTENTS
CHAPTERS PARTICULARS PAGE NO.
CHAPTER 1 INTRODUCTION
1.1: Modeling 6
1.2: Optimization 7
1.3: Classification of polymerization reactions 7
1.4: Polymerization reactors 8
CHAPTER 2 POLYMER REACTION ENGINEERING
2.1: Molecular weight and molecular weight distribution 9
2.2: Kinetics of anionic polymerization 10
2.3: Kinetics of cationic polymerization 13
2.4: Kinetics of free radical polymerization 14
2.5: Kinetics of step growth polymerization 16
2.6: Kinetics of copolymerization 17
2.7: Polymerization reactors 19
2.8: Reactor selection
CHAPTER 3 MODELING
3.1: What are models? 20
3.2: Reasons for developing models 20
3.3: General modeling principles 21
3.4: Classification of models 21
3.5: How to build a model 22
3.6: Modeling of Polymerization reactors 23
CHAPTER 4 OPTIMIZATION
4.1: How to define a model for optimization? 27
4.2: What makes a model hard to solve? 29
4.3: Mathematical relationships 30
4.4: Optimization solution methodologies 32
4.5: Algorithm solutions to optimization problems 32
4
CHAPTER 5 MODELING OF BATCH POLYMERIZATION REACTORS
5.1: Anionic polymerization 36
5.2: Free radical polymerization 38
5.2.1:Model for free radical batch polymerization
reactor 39
5.2.2:MATLAB solution of model 40
5.3: Step growth polymerization 45
5.3.1:Step growth polymerization in absence of catalyst 46
5.3.2:Model for step growth polymerization reactor
in absence of catalyst 47
5.3.2.1:MATLAB solution of model 48
5.3.3:Step growth polymerization in presence of catalyst 53
5.3.4:Model for step growth polymerization reactor
in presence of catalyst 54
5.3.4.1:MATLAB solution of model 55
5.3.5:Comparison of catalyzed and non catalyzed reactions
56
CHAPTER 6 MODELING OF STIRRED TANK POLYMERIZATION
REACTORS
6.1: Anionic polymerization 58
6.1.1:Model for stirred tank anionic polymerization
reactor 59
6.2: Free radical polymerization 60
6.2.1: Model for continuous stirred tank free radical
polymerization reactor 61
6.2.2: MATLAB solution of model 62
6.3: Step growth polymerization 71
6.3.1: Model for continuous stirred tank step growth
polymerization reactor 72
6.3.2:MATLAB solution of model 73
6.4:Reactor dynamics 77
CHAPTER 7 OPTIMIZATION OF POLYMERIZATION REACTORS
7.1: What is multiobjective optimization? 81
7.2: Optimization of polyester reactor 82
5
CHAPTER 1
INTRODUCTION
Synthetic polymers have grown tremendously during last few decades. Today, polymers
are found in a large variety of products ranging from common to very specialized
applications. The new and highly specialized application of polymers, along with the
trend toward totally quality management and global competitiveness, has served to drive
up the quality expectations of the customer. These developments make it imperative to
operate the polymerization processes efficiently, which underscores the importance of
modeling and optimization of polymerization reactors.
In a polymerization reactor, raw materials are mixed at specified operating
conditions to produce polymer(s) having desired properties. The end-use properties of
interest include color, viscoelasticity , thermal properties, and mechanical properties
among others. To produce a polymer with such desired properties means that process
variables such as temperature, molecular weight, molecular weight distribution must be
tightly controlled. The manipulated variables available for controlling the variables of
interest at setpoints include the flow rates of raw materials and catalyst, temperature of
feed streams and temperature, and/or flow rated of heating/cooling mediums. Thus
mathematical modeling of polymerization reactors which relate molecular weight and
molecular weight distribution of polymers with manipulated variables is very important.
1.1 Modeling
Modeling is The representation of a physical system by a set of
mathematical relationships that allow the response of the system to various
alternative inputs to be predicted.
Reasons for developing process models are that we can improve or understand
chemical process operations, improve the quality of produced products, increase
the productivity of existing and new processes, for operator training and process
design etc.
General modeling principles are Steady state modeling, Dynamic modeling and
Constitution relationships.
Models can be classified as. Theoretically based vs. empirical, Linear vs.
nonlinear, Steady state vs. unsteady state, Lumped parameter vs. distributed
parameter and Continuous vs. discrete variables
6
1.2 OPTIMIZATION
Reactors are often the critical stage in a polymerization process. Recently, demands on
the design and operation of chemical processes are increasingly required to comply
with the safety, cost and environmental concerns. All these necessitate accurate
modeling and optimization of reactors and processes. To optimize a reactor, first we
define an objective function, constraints, variables. Then we develop a mathematical
relationship between these. Then we solve these by different optimization solution
methodologies.
1.3 Classification of Polymerization reactions
Polymerization reactions are classified as homogeneous Polymerization and heterogeneous
Polymerization.
In homogeneous polymerization common techniques are bulk polymerization and solution
polymerization. And in heterogeneous polymerization are emulsion polymerization,
suspension polymerization, precipitation polymerization and solid-phase polymerization.
We will focus our attention mostly on bulk and solution polymerization techniques.
On the basis of kinetics main classification of polymerization reactions are cationic,
anionic, free radical and step growth or condensation polymerization.
1.4 Polymerization Reactors
Polymerization reactors can be classified by the phase involved in the reaction.
Classification of Polymerization Reactors
Continuous Phase Dispersed Phase Type of
Polymerization
Polymer solution None Homogeneous bulk
or solution pzn
Polymer solution Any (e.g.
condensation
product)
Heterogeneous bulk
on solution pzn
Water or other non
solvent
Polymer or polymer
solution
Suspension,
dispersion or
7
emulsion pzn
Liquid monomer Polymer (swollen
with monomer)
Precipitation or
slurry pzn
Gaseous monomer Polymer Gas phase pzn
A polymerizer reactor will be heterogeneous whenever the polymer is insoluble in
the monomer mixture from which it was formed. If the polymer is soluble in its
own monomers, a dispersed phase polymerization requires the addition of a non
solvent (typically water) together with appropriate interfacial agents. For high
volume polymers like high volume chemicals continuous operation is generally
preferred over batch.
In a batch reactor feed is entered and product is removed in batches.
In a semi batch reactor initiator or monomer is added continuously and product is
removed in batches.
Tubular reactors are occasionally used for bulk, continuous polymerizations. A
monomer or monomer mixture is introduced at one end of the tube and if all goes
well, a high molecular weight polymer emerges at the other.
Continuous stirred tank reactors are widely used for bulk, free radical
polymerizations. The details for polymerization reactors and their kinetics are
discussed in the next chapters.
8
CHAPTER 2
POLYMER REACTION ENGINEERING
While polymerization and the reactions of polymers are in many respects similar to ordinary
chemical reactions, there are some significant differences that make the former unique in the
sense of reactor and reaction engineering. These are high viscosities and low diffusion rates
associated with concentrated polymer solutions and polymer melts. In polymerization reactors
we have to control the molecular weight and molecular weight distribution to achieve good end
use product properties. These properties include color, viscoelasticity, thermal properties and
mechanical properties. To produce a polymer with such properties means that process variable
such as temperature, molecular weight, molecular weight distribution and mooney viscosity
must be tightly controlled. In this chapter, we will briefly explain about degree of
polymerization, molecular weight and molecular weight distribution and also will explain the
kinetics of various types of polymerization reactions.
2.1: Degree of polymerization, molecular weight and molecular weight distribution
Degree of polymerization:
The no of repeat units per chain is known as degree of
polymerization and it is denoted by x, it is also known as length of polymer chain.
Molecular weight:
Molecular weight of given chain is defined as degree of
polymerization times the molecular weight of repeat unit.
We have defined the degree of polymerization for a single polymer molecule. But not all
polymer molecules within a reactor have the same degree of polymerization. Rather, a
polymer produced in a single reaction exhibits a distribution of chain lengths (degree of
polymerization). The distribution of chain lengths within a polymeric material may will be the
most important factor in determining its end-use properties. Therefore, it will be necessary to
develop a method of describing the distribution of chain lengths in a polymeric material.
As a single reaction exhibits a distribution of chain lengths, the mean of this distribution is the
number average chain length (NACL), this is the weight chain length distribution, and its
average is the weight average chain length (WACL). Respectively, there is the number
9
molecular weight distribution and the weight molecular weight distribution. Their averages are,
respectively, the number average molecular weight (NAMW) and the weight average molecular
weight (WAMW). The values of NAMW and the WAMW will not be necessarily the same.
This is because both are single number attempts to represent an entire distribution. It should be
noted that the end-use properties of a polymer are determined by the distribution of molecular
sizes which is independent of the average used to characterize it. If P
n
(the concentration of
chains containing n polymer units) is known for all values of n, the various averages may be
calculated as follows
nP
n
NACL=
n
= (2.1)
P
n
n
2
P
n
WACL=
w
= (2.2)
nP
n
(nw)P
n
NAMW= m
n
= (2.3)
P
n
(nw)
2
P
n
WAMW= m
w
= (2.4)
(nw)P
n
Molecular weight distribution :
Molecular weight distribution is defined by
polydispersity D which is given as m
w
w
D =
= (2.5)
m
n
n
Inspection of Eqs. (2.1) through (2.5) reveals that the polydispersity takes a value of 1 for a
monodisperse sample (one in which all of the chains are the exact same length). For any other
distribution of chain lengths, the polydispersity will be greater than 1. On the other hand, the
polydispersity varies or slightly with average chain length.
Variations in degree of polymerization (and hence in molecular weight) occur for at least three
reasons. The main mechanism by which the molecular weight distribution is broadened is
through the nature of the series-parallel reaction mechanisms leading to chain formation.
Second mechanism is that of spatial or temporal variations in reaction conditions during
polymerization. Variations in temperature, monomer concentration, etc in any reactor, and in
residence time in a continuous reactor, affect the individual chain lengths. The final mechanism of
variation in degree of polymerization that of stochastic variations reaction rates on a molecular
level. This however has been shown to be insignificant in relation to the previous two. The import
concept, then, is that a distribution of chain lengths will result due to the nature of the reaction
10
mechanisms, even when all environmental variables (temperature monomer concentration, etc.)
are kept constant.
2.2: Kinetics of Anionic Polymerization
Addition polymerization can be carried out by a number of mechanisms. The free radical
mechanism is commercially predominant, but addition polymerization is often carried out by
anionic and cationic mechanisms. Anionic polymerization takes place via the opening of a carbon
double bond on the monomer unit. Initiation takes place with the addition of a negative ion to
the monomer, resulting in the opening of a double bond and growth at the end bearing the
negative charge. Propagation proceeds by addition of monomer units with the carbanion
remaining with the propagating chain end. Termination of a growing chain usually involves
transfer, and only results in the net loss of a growing chain if the new species is too weak to
propagate. Because termination usually involves transfer to some impurity in the system, it is
possible, with carefully purified reagents, to carry out polymerization in which termination is
lacking. The resulting species are termed living polymers and may result in extremely narrow
(essentially monodisperse) molecular weight distributions.
Anionic polymerization is employed with vinyl monomers containing electron-withdrawing
groups such as nitrile, carboxyl, phenyl, or vinyl in an aprotic non-polar solvent. It is
characterized by high rates of polymerization and low polymerization temperatures. Strong
bases such as alkyl metal amides, alkoxides, alkyls, hydroxides, and cyanides are often used to
form the original carbanion.
(2.6)
AM
n
-
+M AM
-
n+1
Propagation (2.7)
AM
n
-
+B AM
n
+B
-
Chain transfer (2.8)
Here A
-
is the anion initiating the polymerization, B is the chain transfer molecule, and B
-
is the new anion formed by chain transfer, which may or may not be capable of initiation of a
new chain. The mechanism can be written in a form which is more concise and consistent with
the subsequent treatment for free radical polymerization as
K
AC A
-
+ C
+
Rate of initiation is given as(R
I
)
Initiation
k
i
R
I=
k
i
A
-
M (2.9)
A
-
+ M P
1
Initiation
11
Rate of propagation is given as(R
P
)
kp
P
n
+ M P
n+1
Propagation R
P
= k
p
P
n
M (2.10)
k
f
Rate of chain transfer
P
n
+ B M
n
+ B
-
Chain transfer R
T
= k
f
P
n
B (2.11)
Here P
n
is taken to mean AM
-
and M
n
represents AM
n
. For very fast reactions, concentration
of reactive species (in this case, ionic chains) becomes essentially constant very early in the
reaction. For this to happen here, the rates of initiation and chain transfer must reach steady
state quickly be equal. This is known as the quasi-steady-state approximation (QSSA).
Based on the mechanism above and making the QSSA for P
n
, the rate of polymerization
can be written as
At steady state
Rate of initiation = Rate of termination
k
i
A
-
M = k
f
P
n
B
k
i
A
-
M
P
n
= (2.12)
k
f
B
Putting the value of P
n
in Eq.(2.10), so
_
kp k
i
A
-
M
2
R
P
= (2.13)
k
f
B
Rate of formation of ion A
-
is given as
-rA
-
= KAC - KA
-
C
+
+ k
i
A
-
M
At steady state (rA
-
=0)
Rearranging KAi
A
-
= (2.14)
KC
+
-k
i
M
Putting value of A
-
from Eq. 2.14 in Eq. 2.13 gives
K kp k
i
AC
M
2
R
P
= (2.15)
K k
f
B C
+
-k
i
k
f
BM
By putting K k
f
= k
f
and also k
i
k
f
=0 , final eq. becomes
12
K kp k
i
AC
M
2
R
P
=
(2.16)
k
f
B C
+
QSSA is only valid for significant chain transfer to an unreactive anion, B
-
. In the
absence of
rapid chain transfer (or of chain transfer to a nonpropagation anion), the rate of
polymerization will continue to rise as the total number of living chains increases until
initiation is complete. Initiation is complete when all of the catalyst has been consumed;
from this point on, the number of live chains will remain constant.
The instantaneous degree of polymerization may be written as the rate of propagation divided
by the rate of chain transfer (rate of production of dead chains).
kp M
x = (2.17)
k
f
B
2.3 CATIONIC POLYMERIZATION
Cationic polymerization is another mechanism of addition polymerization. It proceeds
through chain propagation via a carbonium ion with the opening of a double bond on the
monomer unit as with anionic polymerization. The carbonium ion is formed by the reaction of
a strong Lewis acid (catalyst) with a weak Lewis base (co catalyst) followed by attack on the
double-bonded monomer unit. Termination via terminal double-bond formation and chain
transfer to monomer and polymer are dominant.
C'ationic polymerization is carried out with vinyl monomers containing electron-
releasing groups such as alkoxy, phenyl, and vinyl. The system is characterized by very high
rates of polymerization. The mechanism of cationic polymerization may be written as
Initiation
(2.18)
Propagation (2.19)
Termination (2.20)
Chain transfer (2.21)
Here A is the catalyst and RH is the cocatalyst. These two species react to form the
catalyst-cocatalyst complex in Eq. (2.18). This complex donates a proton to the monomer,
forming a carbonium ion. Because cationic polymerization is usually carried out in a
chlorinated hydrocarbon solvent of low dielectric constant, the anion ( AR
-
) cannot be
separated from the carbonium ion. Rather, the two form an intimate ion pair. Propagation
takes place by the addition of monomer to the growing chain end [Eq. 2.19]. Termination
occurs with the formation of a terminal double bond and the regeneration of the catalyst-
cocatalyst complex [Eq. (2.20)]. Chain transfer to monomer takes place as shown in Eq.
13
+ +
+ +
+
+
+
+ +
+
+ +
+
+
+
+
AR HM M M AR HM
AR H M AR HM
AR HM M AR HM
AR HM M AR H
AR H RH A
n
k
n
n
k
n
n
k
n
k
K
f
i
p
i
1
(2.21). The mechanism can be written in a form which is more concise and consistent with the
previous notation as
Initiation (2.18)
Propagation (2.19)
Termination (2.20)
Chain transfer (2.21)
Here P
n
is taken to mean HM
+
n
AR
-
Based on the mechanism above, the rate of polymerization may be written as the product of
the propagation rate constant, the monomer concentration, and the concentration of live
chains (P). By applying quasi-steady-state approximation for Pn and following the same
procedure as in anionic polymerization on equations (2.18) to (2.21) the rate of
polymerization can be written as
K kp k
i
A(AH)
M
2
R
P
=
(2.22)
k
t
If, as is often the case in ionic polymerization, termination is negligible, the QSSA is not
applicable and the term after the second equality in Eq. (2.22) cannot be used. In this case,
the rate of polymerization will continue to rise as the total number of living chains
increases until initiation is complete. Initiation is complete when all of the catalyst has
been consumed; from this point on, the number of live chains will remain constant. The
instantaneous degree of polymerization may be written as the ratio of propagation to the sum
of the rates of termination and transfer:
M k k
M k
PM k P k
PM k
x
f t
p
f t
p
+
2
(2.38)
Finally the rate of polymerization can be written as
t
i
p p P
k
RM k
M k PM k
dt
dM
R
(2.39)
In the case where inhibition is significant, P is given by
2 / 1
/ 1
1 2
,
_
,
_
M k In k k
I fk
P
i in t
d
(2.40)
The instantaneous degree of polymerization can be defined as the rate of propagation divided by
the rate of production of dead chains (the sum of the rates of all reactions leading to dead
chains):
PT k PS k MP k P k P k
MP k
x
ft fs fm td tc
p
+ + + +
2 2
2 / 1
2.5 Step-Growth Polymerization
Step-growth polymerization involves reaction of functional groups on adjacent monomer
molecules with the evolution of water or other low-molecular-weight by-products. The
reaction is stepwise or step-growth in the sense that the reaction of each functional group is
essentially independent of previous condensation reactions. There are no activated species
as in addition polymerization.
Condensation polymerizations are of two general types. A-B type and A-A/B-B type
Experimental observation of step-growth polymerization yields the following general
characteristics: early disappearance of the monomer, absence of any high polymer during the
early stages of reaction, and equilibrium between polymerization and depolymerization
reactions. These observations suggest a mechanism of linear condensation in which monomer
molecules react to form dimers, the dimers react with each other to form tetramers (or with
other oligomers to form larger oligomers), and the tetramers react with other oligomers to form
longer chains. Thus, in this step-growth mechanism, the monomer disappears rapidly as it is
converted to a dimer. A great deal of low-molecular-weight material is formed early in the
16
reaction, and the average chain length grows slowly as the polymer chains condense to form
longer chains. Because the condensation reaction is reversible, the polymerization is always
in equilibrium with the depolymerization reaction (hydrolysis). The depolymerization can be
controlled by continuously removing the water (or other by-product) of condensation, thus driving
the polymerization to completion. The validity of this sort of polymerization mechanism has
been verified for a large number of linear condensation polymerizations.
Rate expressions for step-growth polymerization can be written from mass-action
kinetics once the mechanism is understood. The condensation is catalyzed by acids. Thus,
for a driven system, the rate of polymerization in the presence of an acid can be written as
A+B+H
+
P+C (2.41)
Where P is Polymer formed and C is a small molecule which is condensed out, A,B
monomers and H
+
is acid which is used to catalyze the reaction.
Rate of Polymerization can be written as:
+
kABH
dt
dA
R
p
(2.42)
For a stoichiometric ratio of A and B, and assuming the acid concentration to be constant
over the reaction, the rate of polymerization may be simplified to
RP =
dt
dA
= k' A
2
( 2 . 4 3 )
In the absence of added strong acid, an acid functional group on the monomer can catalyze
the reaction. The kinetics then becomes
RP =
dt
dA
= k A
2
B ( 2. 44)
Wher e A r epr es ent s t he aci di c f unct i onal gr oup. For a s t oi chi omet r i c
r at i o of f unct i onal gr oups t hi s becomes
RP =
dt
dA
= k A
3
( 2. 45)
The progress of the polymerization reaction can be quantified by introducing the extent of
reaction, p, defined as the fraction of A or B functional groups which have reacted at time t.
The number average chain length is given by the total number of monomer molecules initially
present divided by the total number of molecules present at time t, which can be related to
the extent of reaction as follows:
P P) ( N
N
N
N
1
1
1
0
0 0
( 2. 46)
Inspection of eq. (2.46) will indicate that to obtain the necessary high number average
chain length, the extent of reaction must be well above 0.99.
2.6 COPOLYMERIZATION
One of the most important polymerization techniques is co polymerization. In this type of
polymerization two monomers with different functional groups are reacted. The
17
mechanism of co polymerization is same as that of polymerization. The steps in co-
polymerization are initiation propagation and termination, as for other polymerization
techniques. The mechanism is as under
A.
I.
B.
C.
The I. Symbol is for radical. The rate of decomposition is given by (R
I
= k
I
I).The free
radicals (/.) react wi t h monomer molecules to form chain radicals. The system to be
studied consists of three types of monomers. A, B, and C; hence the initiation stage
can be symbolized. The primary chain radicals A. , B., and C. can now react wi t h
monomers and thereby create a growing chain. This growth phase is symbolized, where
A. , B., and C. now represent pol ymer chains ending with a radical attached to an A,
B. or C monomer. Since there are three monomers, there will be nine possible
reactions. The K
JK
are the
"propagation" rate constants.
A. A.
B. B. P
.
C.
C.
The fourth step in the sequence is the termination reaction where two chain radicals
react to form a "dead" polymer molecule. There are six possible reactions in t hi s last
step. Thi s sequence cont i nues t hrough these four steps unt i l all t he monomer
present is converted to polymer or t he rate of radical formation from t he i ni t i at or
decreases to zero.
18
Radical generation
. I I
i
k
Initiation
. .
.
. .
C C I
B B I
A A I
+
+
+
Growth
. .
. .
. .
. .
. .
. .
. .
. .
. .
C C C
B C B
A C A
C B C
B B B
A B A
C A C
B A B
A A A
CC
CB
CA
BC
BB
BA
AC
AB
AA
k
k
k
k
k
k
k
k
k
+
+
+
+
+
+
+
+
+
Termination
P B C
P C A
P B A
P C C
P B B
P A A
TCB
TAC
TAB
TCC
TBB
TAA
k
k
k
k
k
k
+
+
+
+
+
+
. .
. . .
. . .
. . .
. . .
. . .
Kinetics of the co polymerization is as under
Radical generation R
I
= k
I
I (2.47)
Monomer reaction rates
For monomer A
( ) . . . C k B k A k VA R
CA BA AA A
+ +
(2.48)
For monomer B
( ) . . . C k A k B k VB R
CB AB BB B
+ +
(2.49)
For monomer C
( ) . . . C k A k C k VC R
BC AC CC c
+ +
(2.50)
2.7 POLYMERIZATION REACTORS
There are different types of Polymerization reactors. Here three types will be considered.
1. Batch (or semi batch) reactor
2. Plug flow reactor
3. Continuous stirred tank reactor
1. Batch (or Semi batch) Reactors
The most common polymerization reactor on a numerical basis is the batch kettle. Batch
kettle may range in size from a 5-gal pilot plant kettle, to a 30,000-gal production kettle.
They are generally constructed of stainless steel or glass lined.
If all reactants are added at the beginning of the polymerization, the kettle is said to be
operating in the batch mode. If a reactant is added during the course of polymerization.
The kettle is said to be operating in a semi batch mode.
2. Plug flow reactors
In a plug flow reactor, each element of the reaction mixture can be viewed as an
individual batch reactor. The batch time is the residence time in tubular reactor, which is
easily calculated as the total volume of the tube divided by the volumetric flow rate.
Because no material enters or leaves the fluid element during the reaction time, all of the
kinetic relationships derived thus far for the batch reactor are directly applicable to the
plug flow reactor.Tubular reactors (approximating plug flow characteristics) are
applicable in high volume polymerizations.
3. Continuous stirred tank reactors
19
The use of continuous stirred tank polymerization (in a single CSTR or train multiple
CSTRs in series) may be warranted for high volume products. The nature of the reactor
system results in low processing costs, high throughput and in most cases a highly
uniform product. The fact that the polymerization rate is constant will contribute to
product homogeneity. Large residence time CSTR systems are not particularly flexible
and are therefore best suited to extended production runs of a small number of products.
In low residence time CSTRs (as in olefin polymerization), grade changes can be made
rapidly and low volume products can be made effectively.
CHAPTER 3
MODELING
In this chapter, we will study about use of modeling, modeling principles, how to develop
a model and at the last we will discus that how a polymerization reactor is modeled and
the techniques for solution of difference equations used for modeling purpose.
3.1 What are Models?
Models may be defined in many ways
The process of creating a depiction of reality, such as a graph, picture,
or mathematical representation. OR
The representation of a physical system by a set of mathematical
relationships that allow the response of the system to various alternative
inputs to be predicted.
The Webster dictionary defines the term model as a small representation
of a planned or existing object .
From Mc Graw Hill dictionary we find the following definition, a
mathematical or physical system obeying certain specified conditions,
whose behavior is used to understand a physical, biological or social
system to which it is analogous in some way .
20
Here we define a process model as a set of equations (including
necessary input data to solve the equations) that allows us to predict the
behavior of a chemical process system.
3.2: Reasons for Developing Models
Many reasons for developing process models:
a) Improving or understanding chemical process operations
b) Improve the quality of produced products
c) Increase the productivity of existing and new processes
d) Operator training
e) Process design
f) Safety system analysis
g) Design control system design
h) To simulate and predict real events and processes
3.3: General modeling principles
3.3.1: Steady state modeling
For steady state modeling
[Mass or energy entering in system] - [Mass or energy leaving a system] = 0
The in and out terms would then include the generation and conversion of species
by chemical reaction, respectively.
3.3.2 Dynamic modeling
In this class, we are interested in dynamic balances that have the form:
1
]
1
1
]
1
1
]
1
+
1
]
1
1
]
1
1
]
1
dt
dM
Q
f
M
f
- QM - Vk
p
PM, M(0) = M
0
(3.1)
Where V is the reactor volume, Q
f
and Q are the inlet and outlet volumetric flow rates,
respectively, and P and M are taken to be concentrations of polymer and monomer
respectively.
If P is assumed constant (rapid initiation and no chain transfer), a mass balance over the
live polymer may be written as
QP P Q
dt
dP
V
f f
, P(0) = P
0
(3.2)
where the generation term may be negative or zero as above.
The energy balance may be written as
0
) 0 (
) ( ) (
T T
T T UA PM k H V T Q C T Q C
dt
dT
V C
j p p p f f p p
+
(3.3)
The heat of reaction (propagation), and U and A are the overall heat transfer coefficient and heat
transfer area for the cooling jacket. In view of the viscosity of polymerizing solutions and the
effect of micro mixing on molecular weight development, it may be desirable in some instances to
incorporate a more complex mixing model for the reactor.
3.6.2 Molecular Weight Distribution
In modeling of polymerization reactors it is also important to control the molecular
weight and molecular weight distribution. Therefore it is necessary to develop the
mathematical models which relate the molecular weight and molecular weight
distribution with the process variables. So in the next chapter we will explain the
molecular weight distribution.
24
Models of the form of Eqs. (3.1), (3.2), and (3.3) contains derivative. To solve these we will
have to integrate these equations. These equations can be integrated numerically (or occasionally,
analytically) from specific initial conditions to determine the transient behavior of the system.
For design purposes, it may be acceptable to consider only the steady-state solution. This may
be obtained by setting the time derivatives to zero and solving for M, P, and T. Two methods
are discussed here.
The Method of Moments
If the kth moment of the NCLD is defined as
1 n
n
k
k
P n
k=0 , 1 , 2 The NACL
may be written as the ratio of the zeroth to the first moments:
0
1
n (3.5)
The variance of the NCLD is the second moment about the mean or
2
0
1
0
2
2
,
_
n
(3.6)
Similarly, the k
th
moment of the WCLD may be written as
n
n
k
k
P n w
1
) 1 (
k=1,2, (3.7)
The WACL may be written as
w
=
0
1
=
1
2
,
_
,
_
w
(3.8)
The means of the NMWD and WMWD may be calculated from the NACL and WACL via
Eqs. (2.1) and (2.2). The variances of the NMWD and WMWD are functions of the variances
of the NCLD and WCLD, respectively, as follows:
2 2 2
n mn
w (3.9)
2 2 2
w mw
w (3.10)
Thus it may be seen that if the leading moments of the NCLD (or WCLD) are known, the mean
and the variance of any of the distributions (NCLD, WCLD, NMWD, or WMWD) characterizing
the product may be calculated directly. Once the NAMW and WAMW have been determined. It
(3.4)
25
is possible to reconstruct the entire distribution from an infinite set of moments. If the
distribution is not complex, a good approximation may be made with a finite (even small)
number of moments. In cases of simple kinetics, it may be possible to derive equations for
the development of the moments directly from the mass balances. Consider batch anionic
solution polymerization. Equation dP
n
/dt =
M k
p
) (
1
n n
P P
may be multiplied by n
k
and then summed for all values of n, resulting in
+
1 2
1
1
,
n n
n
k
p n
k
n
p
n k
P n M k P n M k
dt
dP
n
(3.11)
1
10
n
n
P P
Here
1
,
n
k n
k
P n
dt
d
dt
dP
n
k n k
n
1 (3.12)
The final term in Eq.3.11 may be evaluated for k=1,2,3 as
k=0,
0
2
1
n
n
k
P N
(3.13)
k=1,
1 0
2
1
+
n
n
k
P n
(3.14)
k=2,
2 1 0
2
1
2 + +
n
n
k
P n
(3.15)
the equations for the first three moments becomes
, 0
0
dt
d
10 0
) 0 ( P
(3.16)
,
0
1
M k
dt
d
p
10 1
) 0 ( P
(3.17)
, 2
1 0
2
M k M k
dt
d
p p
+
10 2
) 0 ( P
(3.18)
Integration of eqs. (3.16) through (3.18) together with the monomer balance will yield an
adequate characterization of the molecular weight development under isothermal
conditions.
26
z-Transforms
Another way of dealing with the differential difference equations describing the chain
length distribution is through the use of z-transforms. The use of z-transforms is common
in digital process control, but can be used to solve systems of difference equations arising
from any source. The z-transform of P
n
is defined as
), ( ) , (
0
t P z t z F
n
n
n
0 ) ( t P
n
for n<=0 (3.18)
Note that in this case the discrete variable is chain length ( n ) and that time remains a
continuous variable. This is different than in digital control applications where the only
independent variable, time, is being discretized. However, standard tables of z-transforms can
still be used if this difference is kept in mind and the results are interpreted accordingly.
) ( ) (
n k n
P F z P F
k
(3.19)
The moments of the NCLD can be calculated from the z-transform of P
n
(t) as
'
k
k
k
z k
z
t z F
t
) (ln
) , (
) 1 ( lim ) (
1
(3.20)
The z-transform technique is quite similar to the generating function approach. It has an
advantage, however, in that extensive tables of z-transforms are available in the literature.
27
CHAPTER 4
OPTIMIZATION
Reactors are often the critical stage in a polymerization process. Recently, demands on
the design and operation of chemical processes are increasingly required to comply with
the safety, cost and environmental concerns. All these necessitate accurate modeling and
optimization of reactors and processes. To optimize the reactors, in this chapter we have
discussed about optimization.
How to Define a Model for Optimization?
We need to quantify the various elements of our model: decision variables, constraints,
and the objective function and their relationships.
Decision Variables
Start with the decision variables. They usually measure the amounts of resources, such as
money, to be allocated to some purpose, or the level of some activity, such as the number
of products to be manufactured, the number of pounds or gallons of a chemical to be
blended, etc.
Objective Function
Once we've defined the decision variables, the next step is to define the objective, which
is normally some function that depends on the variables. For example profit, production
rate, Conversion, yield, various costs, etc. We usually maximize or minimize objective
function such as we maximize profit, production rate, Conversion ,yield and minimize
various costs.
Constraints
You'd be finished at this point, if the model did not require any constraints. For example,
in a curve-fitting application, the objective is to minimize the sum of squared differences
between each actual data value, or observation, and the corresponding predicted value.
This sum has a minimum value of zero, which occurs only when the actual and predicted
values are all identical. If you asked a solver to minimize this objective function, you
would not need any constraints.
In most models, however, constraints play a key role in determining what values can be
assumed by the decision variables, and what sort of objective value can be attained.
28
Constraints reflect real-world limits on production capacity, market demand, available
funds, and so on. To define a constraint, you first compute a value based on the decision
variables. Then you place a limit (<=, = or >=) on this computed value.
General Constraints. For example, if A1:A5 contains the percentage of funds to be
invested in each of 5 stocks, you might use B1 to calculate =SUM(A1:A5), and then
define a constraint B1 = 1 to say that the percentages allocated must sum up to 100%.
Bounds on Variables. Of course, you can also place a limit directly on a decision
variable, such as A1 <= 100. Upper and lower bounds on the variables are efficiently
handled by most optimizers and are very useful in many problems.
Policy Constraints
Some constraints are determined by policies that you or your organization may set. For
example, in an investment portfolio optimization, you might have a limit on the
maximum percentage of funds to be invested in any one stock, or one industry group.
Physical Constraints
Many constraints are determined by the physical nature of the problem. For example, if
your decision variables measure the number of products of different types that you plan
to manufacture, producing a negative number of products would make no sense. This
type of non-negativity constraint is very common. Although it may be obvious to you,
constraints such as A1 0 must be stated explicitly, because the solver has no other way
to know that negative values are disallowed.
As another example of a physically determined constraint, suppose you are modeling
product shipments in and out of a warehouse over time. You'll probably need a balance
constraint, which specifies that, in each time period, the beginning inventory plus the
products received minus the products shipped out equals the ending inventory -- and
hence the beginning inventory for the next period.
Integer Constraints
Advanced optimization software also allows you to specify constraints that require
decision variables to assume only integer (whole number) values at the solution. If you
are scheduling a fleet of trucks, for example, a solution that called for a fraction of a truck
to travel a certain route would not be useful. Integer constraints normally can be applied
only to decision variables, not to quantities calculated from them.
A particularly useful type of integer constraint specifies that a variable must have an
integer value with a lower bound of 0, and upper bound of 1. This forces the variable to
be either 0 or 1 -- nothing in between -- at the final solution. Hence, it can be used to
model "yes/no" decisions. For example, you might use a 0-1 or binary integer variable to
represent a decision on whether to lease a new machine. Your model might then
29
calculate a fixed lease cost per month, but also a lower cost per item processed with the
machine, if it is used.
Feasible Solution.
A solution (set of values for the decision variables) for which all of the constraints in the
model are satisfied is called a feasible solution. Most solution algorithms first try to find a
feasible solution, and then try to improve it by finding another feasible solution that
increases the value of the objective function (when maximizing, or decreases it when
minimizing).
Optimal Solution
An optimal solution is a feasible solution where the objective function reaches a
maximum (or minimum) value.
Globally Optimal Solution
A globally optimal solution is one where there are no other feasible solutions with better
objective function values.
Locally Optimal Solution
A locally optimal solution is one where there are no other feasible solutions "in the
vicinity" with better objective function values -- you can picture this as a point at the top
of a "peak" or at the bottom of a "valley" which may be formed by the objective function
and/or the constraints. The Solver is designed to find optimal solutions -- ideally the
global optimum -- but this is not always possible.
Whether we can find a globally optimal solution, a locally optimal solution, or a good
solution depends on the nature of the mathematical relationship between the variables and
the objective function and constraints (and the solution algorithm used).
What Makes a Model Hard to Solve?
Solver models can be easy or hard to solve. "Hard" models may require a great deal of
CPU time and random-access memory (RAM) to solve -- if they can be solved at all. The
good news is that, with today's very fast PCs and advanced optimization software from
Frontline Systems, a very broad range of models can be solved.
Three major factors interact to determine how difficult it will be to find an optimal
solution to a solver model:
a) The mathematical relationships between the objective and constraints, and the
decision variables
30
b) The size of the model (number of decision variables and constraints) and its
sparsity
c) The use of integer variables - memory and solution time may rise exponentially as
you add more integer variables
Mathematical Relationships
a) Linear programming problems
b) Smooth nonlinear optimization problems
c) Global optimization problems
d) Nonsmooth optimization problems
The types of mathematical relationships in a model (for example, linear or nonlinear, and
especially convex or non-convex) determine how hard it is to solve, and the confidence
you can have that the solution is truly optimal. These relationships also have a direct
bearing on the maximum size of models that can be realistically solved.
A model that consists of mostly linear relationships but a few nonlinear relationships
generally must be solved with more "expensive" nonlinear optimization methods. The
same is true of models with mostly linear or smooth nonlinear relationships, but a few
nonsmooth relationships. Hence, a single IF or CHOOSE function that depends on the
variables can turn a simple linear model into an extremely difficult or even unsolvable
nonsmooth model.
A few advanced solvers can break down a problem into linear, smooth nonlinear and
nonsmooth parts and apply the most appropriate method to each part -- but in general,
you should try to keep the mathematical relationships in a model as simple (i.e. close to
linear) as possible.
Below are some general statements about solution times on modern Windows PCs (with,
say, 2GHz CPUs and 512MB of RAM), for problems without integer variables
Linear Programming Problems -- where all of the relationships are linear, and hence
convex -- can be solved up to hundreds of thousands of variables and constraints, given
enough memory and time. Models with tens of thousands of variables and constraints
can be solved in minutes (sometimes in seconds) on modern PCs. You can have very
high confidence that the solutions obtained are globally optimal.
Smooth Nonlinear Optimization Problems -- where all of the relationships are smooth
functions (i.e. functions whose derivatives are continuous) -- can be solved up to tens of
thousands of variables and constraints, given enough memory and time. Models with
thousands of variables and constraints can often be solved in minutes on modern PCs.
If the problem is convex, you can have very high confidence that the solutions obtained
are globally optimal. If the problem is non-convex, you can have reasonable confidence
that the solutions obtained are locally optimal, but not globally optimal.
31
Global Optimization Problems -- smooth nonlinear, non-convex optimization problems
where a globally optimal solution is sought -- can often be solved up to a few hundred
variables and constraints, given enough memory and time. Depending on the solution
method, you can have reasonably high confidence that the solutions obtained are globally
optimal.
Nonsmooth Optimization Problems -- where the relationships may include functions
like IF, CHOOSE, LOOKUP and the like -- can be solved up to scores, and occasionally
up to hundreds of variables and constraints, given enough memory and time. You can
only have confidence that the solutions obtained are "good" (i.e. better than many
alternative solutions) -- they are not guaranteed to be globally or even locally optimal.
Model Size
The size of a solver model is measured by the number of decision variables and the
number of constraints it contains.
Most optimization software algorithms have a practical upper limit on the size of models
they can handle, due to either memory requirements or numerical stability.
Sparsity
Most large solver models are sparse. This means that, while there may be thousands of
decision variables and thousands of constraints, the typical constraint depends on only a
small subset of the variables. For example, a linear programming model with 10,000
variables and 10,000 constraints could have a "coefficient matrix" with 10,000 x 10,000 =
100 million elements, but in practice, the number of nonzero elements is likely to be
closer to 2 million.
Integer Variables
Integer variables (i.e. decision variables that are constrained to have integer values at the
solution) in a model make that model far more difficult to solve. Memory and solution
time may rise exponentially as you add more integer variables. Even with highly
sophisticated algorithms and modern supercomputers, there are models of just a few
hundred integer variables that have never been solved to optimality.
This is because many combinations of specific integer values for the variables must be
tested, and each test requires the solution of a "normal" linear or nonlinear optimization
problem. The number of combinations can rise exponentially with the size of the
problem. "Branch and bound" and "branch and cut" strategies help to cut down on this
exponential growth, but even with these strategies, solutions for even moderately large
mixed-integer programming (MIP) problems can require a great deal of time.
32
Optimization Solution Methodologies
Solving and obtaining the optimum values is the last phase in design optimization.
A number of general methods for solving the programmed optimization problems relate
Various relations and constraints that describe the process to their effect on objective
function. these examine the effect of variables on the objective function using analytic,
graphical, and algorithmic techniques based on the principles of optimization and programming
methods.
Procedure with One Variable
There are many cases in which the factor being minimized (or maximized) is an analytic function of
a single variable. The procedure then becomes very simple. Consider the example, where it is
necessary to obtain the insulation thickness that gives the least total cost. The primary variable
involved is the thickness of the insulation, and relationships can be developed showing how this
variable affects all costs.
Cost data for the purchase and installation of the insulation are available, and the length of
service life can be estimated. Therefore, a relationship giving the effect of insulation thickness
on fixed charges can be developed. Similarly, a relationship showing the cost of heat lost as a
function of insulation thickness can be obtained from data on the thermal properties of steam,
properties of the insulation, and heat-transfer con-siderati6"ns. All other costs, such as
maintenance and plant expenses, can be assumed to be independent of the insulation thickness.
Procedure with Two or More Variables
When two or more independent variables affect the objective function, the procedure for
determining the optimum conditions may become rather tedious; however, the general approach is
the same as when only one variable is involved. Consider the case in which the total cost for a
given operation is a function of the two independent variables x and y, or
C
T
= f(x,y)
By analyzing all the costs involved and reducing the resulting relationships to a simple form, the
following function might be found.
C
T
= ax +b/ xy + cy+d
Where a, b, c, and d are positive constants.
(9-36)
33
Graphical Procedure: The relationship among C
T
, X, and y could be shown as a curved
surface in a three-dimensional plot, with a minimum value of C
T
occurring at the optimum
values of x and v. However, the use of a three-dimensional plot is not practical for most
engineering determinations.
Analytical Procedure: The optimum value of x is found at the point where (dC
T
/dx)
y=yi
, is equal to
zero. Similarly, the same results would be obtained if y were used as the abscissa instead of x. If this
were done, the optimum value of y (that is yi) would be found at the point where (dC
r
/dy)
x=x
i.
, is equal
to zero. This immediately indicates an analytical procedure for determining optimum values.
Algorithm Solutions to Optimization Problems
An algorithm is simply an objective mathematical method for solving a problem and is purely
mechanical so that it can be programmed for a computer. Solution of programming problems
generally requires a series of actions that are iterated to a solution, based on a programming
method and various numerical calculation methods. The input to the algorithm can be manual,
where the relations governing the design behavior are added to the algorithm. They can also be
integrated or set to interface with rigorous computer simulations that describe the design.
Use of algorithms thus requires the selection of an appropriate programming method,
methods, or combination of methods as the basic principals for the algorithm function. It also
requires the provision of the objective functions and constraints, either as directly provided relations
or from computer simulation models. The algorithm then uses the basic programming approach to
solve the optimization problem set by the objective function and constraints.
Linear Programming Algorithm Development
To develop this form of approach for linear programming solutions, a set of linear inequalities
which form the constraints are written in the form of "equal to or less than" equations as
m n mn m m
n n
n n
b v a v a v a
b v a v a v a
b v a v a v a
+ + +
+ + +
+ + +
...
........ .......... .......... .......... ..........
...
...
2 2 1 1
2 2 2 22 1 21
1 1 2 12 1 11
........ .......... .......... .......... ..........
m n mn m m
b v a v a v a + + + ...
2 2 1 1
or in general summation form
<
n
j
i j ij
b v a
1
i = 1,2,.,m
for
0 >
j
v
j=1,2,,n
where i refers to rows (or equation number) in the set of inequalities and j refers to
columns (or variable number).
34
As indicated earlier, these inequalities can be changed to equalities by adding
a set of slack variables
m n n
v v
+ +
,....,
1
(here v is used in place of S to simplify the
generalized expressions), so that
1 1 1 2 12 1 11
... b v v a v a v a
n n n
+ + + +
+
2 2 2 2 22 1 21
... b v v a v a v a
n n n
+ + + +
+
..... .......... .......... .......... .......... ..........
m m n n mn m m
b v v a v a v a + + + +
+
...
2 2 1 1
or in general summation form
+
+
n
j
i i n j ij
b v v a
1
) (
i= 1,2,,m
for
j
v
0 j=1,2,..,n+m
In addition to the constraining equations, there is an objective function for the linear
program which is expressed in the form of
z=maximum(or minimum) of n n j j
v c v c v c v c .... ....
2 2 1 1
+ + + +
where the variables j
v
are subject to j
v
0(j=1,2,.,n+m). Note that, in this case, all
the variables above n
v
are slack variables and provide no direct contribution to the value
of the objective function.
Simplex Algorithm:
The basis for the simplex method is the generation of extreme-point solutions by starting at any
one extreme point for which a feasible solution is known and then proceeding to a neighboring
extreme point. Special rules are followed that cause the generation of each new extreme, point to
be an improvement toward the desired objective function. When the extreme point is reached
where no further improvement is possible, this will represent the desired optimum feasible
solution. Thus, the simplex algorithm is an iterative process that starts at one extreme-point
feasible solution, tests this point for optimality, and proceeds toward an improved solution. If an
optimal solution exists, this algorithm can be shown to lead ultimately and efficiently to the
optimal solution.
The stepwise procedure for the simplex algorithm is as follows (based on the
optimum being a maximum):
1. State the linear programming problem in standard equality form.
2. Establish the initial feasible solution from which further iterations can proceed. A common
method to establish this initial solution is to base it on the values of the slack variables,
where all other variables are assumed to be zero. With this assumption, the initial matrix for
the simplex algorithm can be set up with a column showing those variables that will be
35
involved in the first solution. The coefficient for these variables appearing in the matrix table
should be 1 with the rest of column being 0.
3. Test the initial feasible solution for optimality. The optimality test is accomplished by the
addition of rows to the matrix which give a value of Zj for each column, where Zj is defined
as the sum of the objective function coefficient for each solution variable.
4. Iteration toward the optimal solution is accomplished as follows: Assuming that the
optimality test indicates that the optimal program has not been found, the following
iteration procedure can be used:
a. Find the column in the matrix with the maximum value of c
j
- Zj and designate this column
as k. The incoming variable for the new test will be the variable at the head of this column.
b. For the matrix applying to the initial feasible solution, add a column showing the
ratio b
i
/a
ik.
c. . Find the minimum positive value of this ratio, and designate the variable in the
corresponding row as the outgoing variable.
c. Set up a new matrix with the incoming variable, as determined under (a), substituted for the
outgoing variable, as determined under (b). The modification of the table accomplished by
matrix operations so that the entering variable will have a 1 in the row of the departing
variable and 0s in the rest of that column. The matrix operations involve row manipulations
of multiplying rows by constants and subtracting from or adding to other rows until the
necessary 1 and 0 values are reached.
d. Apply the optimality test to the new matrix.
e. Continue the iterations until the optimality test indicates that the optimum objective
function has been attained.
5. Special cases:
a. If the initial solution obtained by use of the method given in the preceding is not feasible, a
feasible solution can be obtained by adding more artificial variables which must then be
forced out of the final solution.
b. Degeneracy may occur in the simplex method when the outgoing variable is selected. If
there are two or more minimal values of the same size, the problem is degenerate, and a poor
choice of the outgoing variable may result in cycling, although cycling almost never occurs
in real problems. This can be eliminated , by a method of multiplying each element in the
rows in question by the positive coefficients of the kth column and choosing the row for the
outgoing variable as the one first containing the smallest algebraic ratio.
6. The preceding method for obtaining a maximum as the objective function can be applied to the
case when the objective function is a minimum by recognizing that maximizing the negative of
a function is equivalent to minimizing the function.
36
CHAPTER No. 5
MODELING OF BATCH POLYMERIZATION
REACTORS
In this chapter, the focus will be shifted from chemistry and kinetics of polymerization to
the mathematical description i.e. modeling of polymerization process. In this chapter, we
will apply mass and energy balances combined with the kinetics of polymerization
reactions for batch reactor. We will focus our main attention to the molecular weight and
molecular weight distribution for different polymerization processes using batch reactors.
We will model the equations to determine the effects of operating conditions on the mean
chain length distributions and the breadth of distribution.
5.1 Anionic Polymerization
Let us consider batch anionic polymerization. Now we apply mass and energy balances to
batch reactor. As there are no inflow and outflow terms for batch polymerizer so the
equation becomes
PM Vk
dt
dM
V
P
which can be written as
(5.1)
0
0
dt
dP
dt
dP
V
( )
0
0 P P
(5.2)
The equation (5.1) and (5.2) can be solved to determine the time dependent behavior of
concentration of monomer and polymer.
To investigate molecular weight distribution it is necessary to develop mass balance over
the concentration of live chains of length n.
The balance for P1 is simply
3 2
2 1
P M P
P P M
P
P
k
k
+
+
(5.3)
37
PM k
dt
dM
P
( )
0
0 M M
1
1
MP k
dt
dP
P
similarly balance for P
2
is
) (
1 2
2
2 1
2
P P M k
dt
dP
MP k MP k
dt
dP
P
P P
from this the balance for P
n
can be written analogous to P
2
(5.4)
we define variance
as under
(5.5)
from this equations (5.1) (5.3) and (5.4) can be written as under
1
1
P
d
dP
P
1
(0)=P
10
(5.6)
) (
1
n n
n
P P
d
dP
, 1
,
1
z F z
d
z dF
( )
10
1
0 , P z z F
(5.9)
equation(5.9) is separable and can be solved as
) exp( ) exp( ) , (
1
10
1
z P z z F
expanding power series in z
-1
(5.10)
now by comparing with definition of z-
transform the eq.(5.10) can be written as
)! 1 (
) (
) exp( ) (
1
10
n
P t P
n
n
(5.11 )
this is poisson distribution with mean (1+
) and variance
.
Polydispersity can be written as
2
1
2 0
n
w
n
w
m
m
D
(5.12)
the variance about mean NACL denoted by
2
n
can be written in term of moments as
2
0
1
0
2
2
,
_
n
(5.13)
38
) (
1
n n P
n
P P M k
dt
dP
( ) ' '
0
dt t M k
t
P
P
d
dM
n
n
n
z
n
P z F
1
1
10
)! 1 (
) (
) exp( ) , (
we know that NACL is defined as in term of moments as
0
1
n
2
0
1
2
,
_
n
(5.14)
Dividing (5.14) on (5.13) gives
2
0
1
2
2
0
1
0
2
2
,
_
,
_
n
n
1
2
1
0 2
2
2
n
n
2
1
0 2
2
2
1
+
n
n
from the definition of Polydispersity given by equation (5.12) it can be written as
2
2
1
n
n
D
+
(5.15)
from eq.(5.5)
+ 1
n
for an ionic polymerization
from eq(5.15)
2
2
1
n
n
D
+
=1+
n
1
(5.16)
Hence for high degree of polymerization D approaches unity meaning NCLD approaches
monodispersity hence ionic polymerization in absence of termination or chain transfer is
useful for creating narrow molecular weight distribution.
The above discussion was for anionic polymerization without chain transfer or
termination. How ever for anionic polymerization where chain transfer takes place.
The instantaneous degree of polymerization may be calculated as the rate of propagation
divided by the rate of chain transfer (rate of production of dead chains).
kp M
x = (5.17)
k
f
B
5.2. Free Radical Polymerization
Consider the free radical polymerization mechanism Ignoring inhibition and considering batch
solution polymerization, the proper mass balances may be written assuming constant reactor
volume and isothermal operation.:
MP k
dt
dM
p
0
) 0 ( M M
(5.18)
39
I k
dt
dI
d
(5.19)
The time derivatives of R and P are set to zero, and R is eliminated from the two equations
2 / 1
2
1
]
1
td tc
d
k k
I fk
P (5.20)
Equations (5.18), (5.19), and (5.20) define the conversion-time behavior of the reactor. Equations
(5.18) and (5.19) can be solved.
Integrating Eq. (5.19)
I
I
t
d
o
dt k
I
dI
0
t k
I
I
d
0
ln
t k
d
e I I
0
(5.21)
Now, integrating eq. (5.18)
M
M
t
p
o
dt P k
M
dM
0
Pt k
M
M
p
0
ln
Pt k
p
e M M
0
(5.22)
Rate of Propagation is given by
PM k R
p p
2 / 1
2
,
_
td tc
d
p p
k k
I fk
M k R (5.23)
and
t
p
n
R
R
X
which can be written as
2 / 1
) ( 2
] [
I ktfk
M k
X
d
p
n
40
5.2.1 Model for Free radical batch polymerization reactors
a E
t
a E
d
a E
p
Time(t)
k
d
I
0
I
f
(Monomer concentration at any time (t))
M
R
p
(Rate of polymerization at any time t)
41
RT Et
t
ae k
/
RT Ed
d
ae k
/
RT Ep
p
ae k
/
t k
d
e I I
,
_
,
_
t I
k
fk
k
t
d
p
e M M
2 / 1
2 / 1
0
fI k R
d i
M I
k
fk
k R
t
d
p p
2 / 1
2 / 1
,
_
( )
2 / 1
2 fI k k
M k
d t
p
n
In model given above:
a=frequency factor
E=activation energy
5.2.2 MATLAB SOLUTION OF MODEL
Knowing the initial concentrations of radical and monomer we can solve this model.
Values of activation energies , different initiator efficiencies and frequency factor values
are available . we can solve this model using MATLAB,
EXAMPLE
Styrene is polymerized by free radical mechanism in a batch reactor. The initial
concentrations of monomer and initiator are 1 M and .001 M.
Model the reactor to determine (a) rate of initiation (b)initiator concentration
(c)rate of polymerization (d)number average degree of polymerization at any time?
At 60 degree C initiator efficiency is0.30 and all other cnstants are as under
kd=1.2*10^-5 (1/sec),kp=176 (1/M s) and kt=7.2*10^7 (1/M s)
MATLAB SOLUTION
MODEL
M0=1;
I0=.001;
T=333;
f=.30;
kd=1.2*10^(-5);
kp=176;
kt=7.2*10^7;
t=input('enter time in seconds at which u want ur calculation=');
I=I0*exp(-kd*t); %concentration of free radicals at time t
Ri=-f*kd*I; % rate of initiation
M=M0*exp(-kp*(f*kd/kt).^.5*t*I.^.5); %concentration of free radicals at time t
Rp=kp*(f*kd/kt).^.5*M*I.^.5; %rate of polymerization at any time t
mun=kp*M/(2*(f*kd*kt*I).^.5); %number average degree of polymerizationat time t
Lt=I/(kd*f*I); %free radical life time
disp('concentration of free radicals= ')
disp(I)
disp('concentration of monomers=')
disp(M)
disp('rate of polymerization=')
disp(Rp)
disp('number average degree of polymerization=');
disp(mun)
disp('free radical life time=')
disp(Lt)
SOLUTION
enter time in seconds at which u want ur calculation=60
concentration of free radicals=
42
9.9928e-004
concentration of monomers=
0.9999
rate of polymerization=
1.2440e-006
number average degree of polymerization=
172.8977
free radical life time=
2.7778e+005
Effect of time on concentration of radical
I0=.001;
kd=1.2*10^(-5);
t=1:1800;
I=I0*exp(-kd*t);
plot(t,I)
0 200 400 600 800 1000 1200 1400 1600 1800
9.7
9.8
9.9
10
x 10
-4
graph b/w time and concentration of radical
concentration
of radicals
(M)
time(seconds)
43
Effect of time on rate of polymerization
M0=1;
kp=176;
kt=7.2*10^7;
kd=1.2*10^(-5);
I0=.001;
f=.30;
t=1:1800;
I=I0*exp(-kd*t);
M=M0.*exp(-kp*(f*kd/kt).^.5.*t.*I.^.5);
Rp=kp*(f*kd/kt).^.5*M.*I.^.5;
plot(t,Rp)
0 200 400 600 800 1000 1200 1400 1600 1800
1.23
1.235
1.24
1.245
x 10
-6
rate of polymerization graph b/w and time
rate of
polymerization
time(seconds)
(M/sec/l)
44
Effect of time on degree of polymerization
M0=1;
kp=176;
kt=7.2*10^7;
kd=1.2*10^(-5);
I0=.001;
f=.30;
t=1:1800;
I=I0*exp(-kd*t);
M=M0.*exp(-kp*(f*kd/kt).^.5.*t.*I.^.5);
Rp=kp*(f*kd/kt).^.5*M.*I.^.5;
mun=kp*M./(2*(f*kd*kt*I).^.5);
plot(t,mun)
0 200 400 600 800 1000 1200 1400 1600 1800
172.8
173
173.2
173.4
173.6
173.8
174
174.2
174.4
graph b/w time and degree of polymerization
degree of
polymerization
time(sec)
45
5.3:Step growth polymerization
The polymerization in which polyfunctional reactants react to produce larger units in a
continuous stepwise manner.
Step growth polymerization:
1. In absence of solvent or catalyst
2. In presence of catalyst
5.3.1:step growth polymerization in absence of solvent or catalyst.
Assume the polyesterification is conducted in the absence of solvent or
catalyst and that the monomers are present in stoichiometric ratio.
Then by applying the law of conservation of mass equation for batch
reactor. As there are no inflow and outflow terms so the eqn. can be written as
2
kA
dt
dA
(5.24)
integrating eq. (5.24)
t A
A
dt k
A
dA
o
0
2
(5.25)
kdt
A
+
+
1 2
1 2
A
A
t
o
dt k
A
0
1
1
1 1
+
kt A
A
A
kt A
A
A
A
A
kt
A A
o
o
o
o
o o
o
1
) (
+
kt A
A
t A
o
o
(5.26)
and P is given by
0
0
) (
A
t A A
p
(5.27)
and
n
p p A
A
A
A
o
o o
n
1
1
) 1 (
(5.28)
and
w
p
p
w
1
1
(5.29)
Finally we get the value of D by dividing the above two equations. (5.28) and (5.29).
p D
n
w
+ 1
46
5.3.2 Model for batch polycondensation reactors
(in absence of catalyst)
Activation energy of the reaction(E)
T(Temperature) Frequency factor(a)
k
Initial concentration
of monomer A(A
0
) A(t) Concentraion of
monomer at any
time(t) time (t)
A(t)
P
Monomer conversion
P
P
Weight
w
Number
Average Average
D.P D.P
Molecular Weight
Distribution
47
1
) (
0
0
+
kt A
A
t A
0
0
) (
A
t A A
P
P
n
1
1
n
w
MWD
RT E
ae k
/
P
P
w
1
1
kt A
A
t A
2
0
0
2 1
) (
+
(5.32)
P is given as
0
0
) (
A
t A A
P
(5.33)
n
p p A
A
,
_
2
2
0
0
) 1 (
1
) 1 (
2
) 1 (
1
p
n
(5.34)
From the equations (5.30) to (5.34) we can develop a model of batch step growth polymerization
reactor in presence of catalyst.
53
5.3.4 Model for batch polycondensation reactor
(in presence of catalyst in stoichiometric ratio )
Activation energy of the reaction(E)
T(Temperature) Frequency factor(a)
k
Initial concentration
of monomer A(A
0
) A(t) Concentraion of
monomer at any
time(t) time (t)
A(t)
P
Monomer conversion
n
Number
Average
D.P
54
1 0 2
0
) (
2
+
kt A
A
t A
0
0
) (
A
t A A
P
RT E
ae k
/
2
) 1 (
1
p
n
5.3.4.1 MATLAB Solution of Model
Polyesterification is conducted in the presence of solvent or catalyst and that the monomers and
acid are present in stoichiometric ratios.Model the reactor .given is that the dicarboxylic acid
concentration is 3 mol L^-1 and polymerization rate constant is 10^-1 Lmol^-1 S^-1
MODEL
k=10^-1;
A0=3;
t=input('enter time at which u want to calculate parameters in sec=');
A=A0./(A0.^2*k*t+1).^.5;
p=(A0-A)/A0;
mun=1./(1-p).^2;
disp('monomer concentration=')
disp(A)
disp('monomer conversion=')
disp(p)
disp('number average degree of polymerization is =')
disp(mun)
OUTPUT:
enter time at which u want to calculate parameters in sec=50
monomer concentration=
0.4423
monomer conversion=
0.8526
number average degree of polymerization is =
46.0000
55
Effect of time on monomer conversion
t=[0:300];
k=10^-1;
A0=3;
A=A0./(A0.^2*k*t+1).^.5;
p=(A0-A)/A0;
p=(A0-A)./A0;
plot(t,p)
CHAPTER 6
MODELING OF CONTINOUS STIRRED TANK
POLYMERIZATION REACTORS
58
0 0.1 0.2 0.3 0.4 0.5 0.6 0.7 0.8 0.9 1
0
50
100
150
200
250
300
catalyzed
Noncatalyzed
conversion
NACL
In this chapter we will apply the mass balance for polymerization techniques on CSTR. And we
will derive the time conversion behaviour of polymerization reactors.
6.1 Anionic Polymerization
If we assume rapid initiation and no termination or chain transfer, the monomer and total polymer
balances for anionic polymerization are given by
PM Vk QM M Q
dt
dM
p f f
0
) 0 ( M M
(6.1)
QP P Q
dt
dP
V
f f
0
) 0 ( P P
,
1 n
n
P P
(6.2)
Balances on P
1
and P
n
may be written as
1 1
1
MP Vk P Q
dt
dP
V
p f f
10 1
) 0 ( P P
(6.3)
2
, 0 ) 0 (
) (
1
>
n
P
P P M Vk QP P Q
dt
dP
V
n
n n p n nf f
n
(6.4)
If the inflow and outflow terms are set equal and the feed is assumed to contain only P1, the
following steady-state balances may be obtained from Eqs. (6.1), (6.2), (6.3), and (6.4):
f f
P P P
1
(6.5)
MP Vk M M Q
p f
) (
(6.6)
1 1 1
) ( MP Vk P P Q
p f
(6.7)
) (
1
n n p n
P P M Vk QP
(6.8)
This system of difference equations may be solved by z-transforms to give
,
) 1 (
1 f p
f
P k
M
M
+
Q
V
(6.9)
1
1
1
1
) 1 (
) 1 ( ) 1 (
1
1
]
1
+ +
n
f
n
p
p
p
f
P
M k
M k
M k
P
Pn
(6.10)
1
1
n (6.11)
+ 1 D
(6.12)
where as
1
1
]
1
) 1 ( M k
M k
p
p
(6.13)
from the above equations model can be developed as
6.1.1 Model for continuous stirred tank anionic polymerization reactor
59
T a -E
p
V Residence
Time( )
Q
p
k
M
f
M
Number
average
Weight avg.D.P D.P
Polydispersity
6.2. Free Radical Polymerization
Consider the free radical polymerization mechanism Ignoring inhibition and considering
CSTR solution polymerization, the proper mass balances may be written assuming constant
reactor volume and isothermal operation. If q is the volumetric feed rate and the
subscript/indicates feed conditions, balances over monomer and initiator yield:
60
RT Ep
P
ae k
/
Q
V
) 1 (
1 f P
f
P k
M
M
+
) 1 ( M k
M k
p
p
1
1
w
1
1
n
+ 1
n
w
D
V MP k M M Q
dt
dM
V
p f
) (
0
) 0 ( M M
(6.14)
I Vk I I Q
dt
dI
V
d f
) (
(6.15)
As before, the time derivatives of R and P are set to zero, and R is eliminated from the two
equations
2 / 1
2
1
]
1
td tc
d
k k
I fk
P (6.16)
Equations (6.14), (6.15), and (6.16) define the conversion-time behavior of the reactor.
At steady state, flow rate in and flow rate out are equal and there is no accumulation. There fore, the
terms dM/dt and dI/dt are zero. So Eq. (6.14) and (6.15) become
V MP k M M Q
p f
) (
= 0
I Vk I I Q
d f
) (
=0
by solving these
p
f
k
M
M
+
1
(6.16)
(6.17)
6.2.1 Model for continuous stirred tank free radical polymerization reactor
T,a
61
d
f
k
I
I
+
1
E
p
E
fs
E
fm
E
td
E
tc
E
d
f
I I
f
I
I
M
f
M
S
Number
average
Weight avg.D.P D.P
Polydispersity
62
2 / 1
2
,
_
td tc
d
k k
I fk
P
Q
V
) 1 ( P k
M
M
P
f
+
) / 1 ) ( (
+ + + + +
P k k S k M k M k
M k
td tc fs fm p
p
1
1
w
1
1
n
+ 1
n
w
D
RT E
td
td
ae k
/
RT E
tc
tc
ae k
/
RT E
fm
fm
ae k
/
RT E
fs
fs
ae k
/
RT E
P
p
ae k
/
) 1 ( f k
I
I
d
f
+
RT E
d
d
ae k
/
69
0 50 100 150 200 250 300
0
0.5
1
1.5
2
2.5
3
3.5
x 10
4
NACL &
WACL
Residence time(sec)
Effect of residence time on MWD
theta=[0:300];
Mf=1;
If=.001;
f=.30;
R=8.314;
S=.03;
T=303;
kp=2.16*10^7*exp(-32500./(8.314*T));
ktc=2.59/2*10^3*exp(-9920./(8.314*T));
ktd=0;
kfm=2167*exp(-48.185*10^3./(8.314*T));
kfs=7.57*10^8*exp(-9.2*10^4./(8.314*T));
kd=1.22*10^13*exp(-1.206*10^5./(8.314*T));
I=If./(1+theta*kd*f);
. P=((2.*f.*kd.*I)./(ktc+ktd)).^.5;
M=Mf./(1+theta.*kp.*P);
alpha=kp.*M./(kp.*M+kfm.*M+kfs.*S+(ktc+ktd).*P+1./theta);
D=1+alpha;
plot(theta,D)
70
Effect of residence time on MWD
0 50 100 150 200 250 300
1.98
1.985
1.99
1.995
2
2.005
MWD
Residence time(sec)
Effect of residence time on monomer concentration
plot(theta,M) ( in previous workspace)
0 50 100 150 200 250 300
0.988
0.99
0.992
0.994
0.996
0.998
1
1.002
Monomer
cocentration
Residence time(sec)
6.3. Step-Growth Polymerization
71
Step-growth polymerization kinetics can be represented by
A-B + A-B A-B-A-B + W
An analysis of the MWD during step-growth polymerization in a CSTR at steady-state can be begun
by making the assumption of irreversible polymerization (due, perhaps, to the continuous removal
of the condensation product, W) and writing mass balances on the growing chains:
P P k P P
p f 1 1 1
(6.18)
nf
P
- n
P
= p
k
1
1
n
r
r n r
P P
1 > n (6.19)
2 n
n
P P
(6.20)
Assuming the feed consists of P
1
only, solution of Eqs. (6.18) through (6.20).
by z-transform techniques indicates that the NCLD is a binomial distribution with the
following leading moments:
p
f p
k
P k
2 / 1
1
0
] 2 1 [ 1 + +
(6.21)
) 55 . 5 )( 1 (
) 54 . 5 (
1 1 2
1 1
f p f
f
P k P
P
The NACL, WACL and polydispersity can then be calculated as
] ) 2 1 ( 1 [
2 / 1
1
1
f p
f p
n
P k
P k
+ +
(6.22)
f p w
P k
1
1 +
(6.23)
f p
f p f p
P k
P k P k
D
1
2 / 1
1 1
] ) 2 1 ( 1 )[ 1 (
+ + +
(6.24)
The extent of reaction in a CSTR is defined as
f
p
f
f
P
p k
P
P P
p
1
2
1
1
2
1
(6.25)
Equations (6.22)-(6.24) can be written in terms of the extent of reaction as
p
n
1
1
(6.26)
2 2
) 1 (
2 1
) 1 (
2
1
p
p
p
p
w
+
(6.27)
p
p
D
+
+
1
1
2
(6.28)
A number of important points can be made from these last equations. As with step-growth
polymerization in a batch reactor, the extent of reaction must be almost unity before a large NACL
can be achieved. High conversion products usually cannot be made economically in a single
CSTR because this would require the CSTR to operate at almost complete conversion, and
would require a reactor of very large volume. In addition, note that as the extent of reaction
72
approaches unity (giving a high-molecular-weight product), the polydispersity increases
without bound. For both these reasons, step-growth polymerization is rarely carried out in a single
CSTR. A series of CSTRs or, preferably, a PFR is preferred if step-growth polymerization is to
be carried out continuously.
In summary, because the lifetime of a growing polymer chain is equal to its residence time
in the reactor, the effect of the residence time distribution causes extreme broadening of the
molecular weight distribution during step-growth polymerization in a CSTR. The constancy
of the polymerization environment, which acted to narrow the distribution in free radical
polymerization, has an insignificant effect in step-growth polymerization.
6.3.1: Model for continuous stirred tank step growth polymerization reactor
T a -E
p
V Residence
Time( )
Q
p
k
P
1f
M
6.3.2: MATLAB SOLUTION OF MODEL
V=5000
Q=input('enter flow rate= ');
theta=V/Q
73
RT Ep
P
ae k
/
Q
V
f p
P k
w
1
1 +
( ) ( ) [ ]
f p
f p f p
n
w
P k
P k P k
D D
1
2 / 1
1 1
2 1 1 1
+ + +
( ) [ ]
2 / 1
1
1
2 1 1
f p
f p
n
P k
P k
+ +
kp=10;
p1f=.01;
mun=(kp*theta*p1f)./(-1+(1+2*kp*theta*p1f).^.5);
muw=1+kp*theta*p1f;
D=muw./mun;
disp(mun)
disp(muw)
disp(D)
SOLUTION
V =
5000
enter flow rate= 5
theta =
1000
7.5887
101
13.3092
Effect of residence time on weight avg.degree of polymerization
0 1000 2000 3000 4000 5000 6000 7000 8000 9000 10000
0
200
400
600
800
1000
1200
muw
time(sec)
Effect of residence time on MWD
theta=[1:1800];
kp=10;
74
p1f=.01;
mun=(kp*theta*p1f)./(-1+(1+2*kp*theta*p1f).^.5);
muw=1+kp*theta*p1f;
D=muw./mun;
plot(theta,D)