. 2025 Feb 28;11:e2703. doi: 10.7717/peerj-cs.2703

Algorithm 2 . Pseudocode of is MBR01.

Input: ifpifs-matrix

[a_{i j}]_{m \times n}

Output: Score matrix

[s_{i 1}]_{(m - 1) \times 1}

, Optimum alternatives

[o p_{i 1}]

[b] \leftarrow [0]_{(m - 1) \times 1}

and

[c] \leftarrow [0]_{(m - 1) \times 1}

2: for i from 1 to

m - 1

3: for k from 1 to

m - 1

4: for j from 1 to n do

b_{i 1} \leftarrow b_{i 1} + a_{1 j}^{1} s g n (a_{i j}^{1} - a_{k j}^{1})

c_{i 1} \leftarrow c_{i 1} + a_{1 j}^{2} s g n (a_{i j}^{2} - a_{k j}^{2})

7: end for

8: end for

9: end for

10:

[s] \leftarrow [0]_{(m - 1) \times 1 \times 2}

11: for i from 1 to

m - 1

12: if

max_{k \in I_{m - 1}} {b_{k 1}} + | max_{k \in I_{m - 1}} {c_{k 1}} | + | min_{k \in I_{m - 1}} {b_{k 1}} | \neq 0

AND

min_{k \in I_{m - 1}} {b_{k 1}} \neq 0

then

13:

s_{i 1}^{1} \leftarrow \frac{b_{i 1} + | min_{k \in I_{m - 1}} {b_{k 1}} |}{max_{k \in I_{m - 1}} {b_{k 1}} + | max_{k \in I_{m - 1}} {c_{k 1}} | + | min_{k \in I_{m - 1}} {b_{k 1}} |}

14:

s_{i 1}^{2} \leftarrow 1 - \frac{b_{i 1} + | c_{i 1} | + | min_{k \in I_{m - 1}} {b_{k 1}} |}{max_{k \in I_{m - 1}} {b_{k 1}} + | max_{k \in I_{m - 1}} {c_{k 1}} | + | min_{k \in I_{m - 1}} {b_{k 1}} |}

15: else

16:

s_{i 1}^{1} \leftarrow 1

17:

s_{i 1}^{2} \leftarrow 0

18: end if

19: end for

20:

[s v] \leftarrow [0]_{(m - 1) \times 1}

21: for i from 1 to

m - 1

22:

s v_{i 1} \leftarrow s_{i 1}^{1} - s_{i 1}^{2}

23: end for

24:

[a v] \leftarrow [0]_{(m - 1) \times 1}

25: for i from 1 to

m - 1

26:

a v_{i 1} \leftarrow s_{i 1}^{1} + s_{i 1}^{2}

27: end for

28:

[o p] \leftarrow \underset{k \in I_{m - 1}}{a r g m a x} {s v_{k 1}}