Information Technology Reference
In-Depth Information
for the case of positive consonance between criteria
C
i
and
D
and
1
2
(
y
i
=
b
D
,
O
j
−
b
D
,
O
k
)
for the case of negative consonance between these criteria.
Second Algorithm
2.1. Determine those objects
O
j
, for which for each
i
(
1
≤
i
≤
p
)
:
a
C
i
,
O
j
≤
x
i
and
those objects
O
k
, for which for each
i
(
1
≤
i
≤
p
)
:
a
C
i
,
O
k
≥
x
i
.
2.2. Determine object
O
r
, so that
a
C
i
,
O
r
is the highest
a
-element from the determined
x
i
.
2.3. Determine object
O
s
, so that
a
C
i
,
O
s
in Step 2.1 and
a
C
i
,
O
r
≤
is the lowest
a
-element from the determined
in Step 2.1 and
a
C
i
,
O
s
≥
x
i
.
2.4. Determine
⎧
⎨
i
=
1
p
x
i
−
a
C
i
,
O
r
b
D
,
O
s
−
b
D
,
O
r
b
D
,
O
r
+
.
a
C
i
,
O
s
−
a
C
i
,
O
r
,
if
b
D
,
O
s
≥
b
D
,
O
r
p
y
=
.
⎩
p
i
=
1
a
C
i
,
O
r
a
C
i
,
O
s
−
x
i
−
b
D
,
Or
−
b
D
,
Os
b
D
,
O
s
+
.
a
C
i
,
O
r
,
otherwise
p
Now we discuss two (standard) formulas for evaluation of the
y
-values. Let the
IM
O
1
...
O
k
...
O
n
C
1
a
C
1
,
O
1
...
a
C
1
,
O
k
...
a
C
1
,
O
n
.
.
.
.
.
.
B
=
C
i
a
C
i
,
O
1
...
a
C
i
,
O
k
...
a
C
i
,
O
n
.
.
.
.
.
.
C
p
a
C
p
,
O
1
...
a
C
p
,
O
k
...
a
C
p
,
O
n
D
b
D
,
O
1
...
b
D
,
O
k
...
b
D
,
O
n
be given.
1. For every
k
(
1
≤
k
≤
n
)
we construct the IM
B
k
=
B
O
k
)
.
(
⊥
,
2. For every
i
(1
a
C
i
,
O
k
.
3. Using the two above described methods (for the fixed number
k
), for
B
k
and
x
1
,...,
≤
i
≤
p
) we put
x
i
=
x
p
, we determine
y
-values
y
k
,
1
,
y
k
,
2
.
4. For
s
(
s
=
1
,
2
)
, we determine numbers
z
k
,
s
=|
y
k
,
s
−
b
D
,
O
k
|
.
Search WWH ::
Custom Search