Professional Documents
Culture Documents
Instructor: . Kokossis
Laboratory teaching staff: . Nikolakopoulos
Decomposition methods, partitioning and ranking
Overview
Motivation
Assignment problem
Partitioning methods
Precedence order
Decomposition methods, partitioning and ranking
Example Let us examine the system:
f1 : x1 + x 4 10 =
0
f 2 : x 22 x 4 x 3 x 5 6 =0
2 ( 4)
f 3 : x1 x1.7 x 8 =0
f 4 : x 4 3x1 + 6 =0
f 5 : x1 x 3 x 5 + 6 =0
f1 : x1 + x 4 10 =
0
f 2 : x 22 x 4 x 3 x 5 6 =0
2 ( 4)
f 3 : x1 x1.7 x 8 =0 S1: 2x2 S2: 1x1 S3: 2x2
f 4 : x 4 3x1 + 6 =0
f 5 : x1 x 3 x 5 + 6 =0
Methodology
Problem representation
We can permute the order of appearance of the rows and columns in the
matrix
Assignment problem:
(Steward 1962)
Match each variable with ONE and ONLY ONE equation
The variable assigned to each equation is called output variable for that
equation (implying that the system can b solved for that variable using
other variables that have been already been calculated)
x1 output variable of f1, x5 of f2 etc.
Assignment problem theory
If the is no matching then the matrix is structurally singular, i.e. we have a
number of redundant equations
When the assignment problem has a unique solution then (and only then)
the system can be full partitioned, i.e. the system is decomposed into the
smaller possible subsystems, where each one of them consists of one
variable and one equations
In our example we have multiple solutions, therefore it is no possible to
end up into a full partitioning
or
Basic heuristic
Choose the column (or row) with the smaller number of elements
From this column, select that row with the less number of elelments
Analytical methods
Select x2(2)
Select f3
, = 1 , = 1,2,
, = 1 , = 1,2,
Where
i,j: rows and columns of the matrix
Yi,j: binary variable that defines if xj is an output variable of fi (Yi,j=1) or
not (Yi,j=0)
The problem is theoretical difficult in large systems, BUT we can prove
that by relaxing the binary variables as continuous, the problem is solved
to an integer solution (thus it is practically easy).
Partitioning and ranking
Directed graphs:
Represent each equation as a graph
Define directed arcs between
graphs fi and fj when and only when
the output variable of fi appears in fj
f1 f2 f3 f4 f5
Partitioning and ranking
Partitioning procedure:
Basic idea: Systematic grouping of graphs into subsystems with parallel
classification of the resulting subsystems
Begin by any graph recording moves from directed arcs.
The arcs will end
a) Either in graph already visited
b) Either in a graph without an output
In case (a) we merge the graphs between two consecutive visits to a group
(partition groups). We merge graphs and arcs and we continue.
In case (b), the graph that is recognized without output passes into a ranking
list. Then we remove the graph and all its connections from the system and
we continue.
Example
f1 f2 f3 f4 f5
Route f1 > f3 > f2> f5 > f2. From (a) we merge f2-f5 in one graph
f1 f3 f4 f2 f5
Repeat route: f1 > f3 > f2f5, without exit. From (b) we cancel graph f2f5 and
we pass it into a ranking list.
Ranking list
f2f5
Example
f1 f3 f4
New route: f1 > f3. Without exit. From (b) we cancel graph f3 and we pass it
into the ranking list
Ranking list
f2f5 f1 f4
f3
Route f1 > f4 > f1. From (a) we merge f2-f5 in one graph. We add the
merged graph into the ranking list
Ranking list
f2f5 partition group 1
f3 partition group 2
f1f4 partition group 3
Partitioning and ranking properties
Partitioning
Can be applied either at the large system of the flowsheet or in the
solution framework of the solution of the process balances of the
flowsheet
Tear variables
Are related to the incidence matrix and can be selected based on its
structure
Appear, as in the partitioning case, either in the total flowsheet
framework, either in the framework of a particular process.