An Extension of the Nested Partitions Method
EBERT BREA
Procedure. Partitioning(n, m, Θ, σ, d(k))
Given:
the
l(i) ≤−x(i) ≤−u(i),
the
lσ(i) ≤−x(i) ≤−u(iσ ),
the
|
{z
}
n
;
|
{z
}
m
);
Let
Declare:
a
i=1,j=1
a
i=1,j=1
Let
(b(n+m−1), b(n+m−2),
if u(ℓσ ) −−
δ(ℓ) =
x(i,ℓ) ←−
x(i+1,ℓ) ←−
else
x(i,ℓ) ←−
x(i+1,ℓ) ←−u(ℓσ );
for ℓ ←−n +
if u¯(ℓσ ) −−
δ(ℓ) =
y(i,ℓ−n) ←−
y(i+1,ℓ−n) ←−
if (b(ℓ−1) =
y(i,ℓ−n) ←−
y(i+1,ℓ−n) ←−u¯(ℓσ );
if (b(ℓ−1) =
y(i,ℓ−n) ←−
y(i+1,ℓ−n) ←−
if (b(ℓ−1) =
y(i,ℓ−n) ←−
y(i+1,ℓ−n) ←−u¯(ℓσ );
Let
Figure 18.
Revista
Semestre
ISSN
ISSN:
135