IVIF-MABAC: Interval-Valued Intuitionistic Fuzzy MABAC (Xue, You, Lai, Liu 2016)

Overview

Border-approximation-area MCDM under Interval-Valued Intuitionistic Fuzzy uncertainty (IVIFN: ([μ⁻,μ⁺],[ν⁻,ν⁺]); μ⁺+ν⁺ ≤ 1). Output typically utility (higher value = preferred).

Strengths

• •Method-specific: Border-approximation-area MCDM under Interval-Valued Intuitionistic Fuzzy uncertainty (IVIFN: ([μ⁻,μ⁺],[ν⁻,ν⁺]); μ⁺+ν⁺ ≤ 1)
• •Preserves interval_intuitionistic uncertainty through the pipeline rather than premature crispification at elicitation
• •Native group-decision support (multi-DM aggregation built into the pipeline)

Limitations

• •Rank reversal known on alternative-set changes (ref: Inherited from crisp MABAC (Pamučar-Ćirović 2015); generally insensitive in IVIF setting per Xue 2016 §3 sensitivity analysis.)
• •Assumes: Decision matrix entries are valid IVIFNs (μ⁺+ν⁺ ≤ 1)
• •Assumes: DM weights λ_k sum to 1 in MAGDM group setting
• •Assumes: Underlying MABAC compensation assumption holds in uncertain interval space
• •Assumes: All decision-makers use the same linguistic-to-IVIFN translation table

Assumptions to verify

• •Decision matrix entries are valid IVIFNs (μ⁺+ν⁺ ≤ 1)
• •DM weights λ_k sum to 1 in MAGDM group setting
• •Underlying MABAC compensation assumption holds in uncertain interval space
• •All decision-makers use the same linguistic-to-IVIFN translation table

When not to use

• •Crisp data sufficient: use base MABAC directly
• •Single-valued IFS already provides enough granularity: use IF-MABAC (Li 2021)
• •Decision criteria are correlated: use IF-MABAC with Choquet integral (Liang 2019)

Edge cases

• •IF decision matrix X̃^(k) = (x̃^k_ij)_{m×n} with x̃^k_ij = ([a^k_ij, b^k_ij], [c^k_ij, d^k_ij]); aggregate the l DM matrices via IVIFWG operator with DM weights λ_k (Σ λ_k = 1) into the group IVIF dec
• •If H is partial, solve linear-programming model M-1 (Eq. 19) maximizing total IVIF Hamming distance D(w). If H is completely unknown, solve M-2 (Eq. 20) via Lagrange method giving closed-form Eq. 21.
• •IF decision matrix R̃ = (r̃_ij)_{m×n} by applying scalar-IVIFN multiplication (Eq. 22) to each entry x̃_ij of the normalized group matrix with λ = w_j.
• •IF Euclidean distance (Eq. 26). Sign is positive if r̃_ij ≥ g̃_j by the comparison rule (score then accuracy, Def 5), otherwise negative: interpreting whether the alternative lies above (upper area G
• •If CC_i > 0, A_i is in the upper area G⁺ (near ideal A⁺); if CC_i < 0, A_i is in the lower area G⁻ (near anti-ideal A⁻).

Common pitfalls

• •Hatalı: 'IVIF-MABAC bu varsayımı kontrol etmeden uygulamak'. Doğrusu: Decision matrix entries are valid IVIFNs (μ⁺+ν⁺ ≤ 1)
• •Hatalı: 'IVIF-MABAC bu varsayımı kontrol etmeden uygulamak'. Doğrusu: DM weights λ_k sum to 1 in MAGDM group setting
• •Hatalı: 'IVIF-MABAC bu varsayımı kontrol etmeden uygulamak'. Doğrusu: Underlying MABAC compensation assumption holds in uncertain interval space
• •Hatalı: 'IVIF-MABAC bu varsayımı kontrol etmeden uygulamak'. Doğrusu: All decision-makers use the same linguistic-to-IVIFN translation table
• •Hatalı: IVIF-MABAC'yi 'Crisp data sufficient' durumunda kullanmak: recommendation_metadata.not_recommended_when alternatif öneriyor.
• •Hatalı: IVIF-MABAC'yi 'Single-valued IFS already provides enough granularity' durumunda kullanmak: recommendation_metadata.not_recommended_when alternatif öneriyor.
• •Hatalı: IVIF-MABAC'yi 'Decision criteria are correlated' durumunda kullanmak: recommendation_metadata.not_recommended_when alternatif öneriyor.

Worked example

1. 1.Adım 1 (F1): Step 1: Build each DM's IVIF decision matrix X̃^(k) = (x̃^k_ij)_{m×n} with x̃^k_ij = ([a^k_ij, b^k_ij], [c^k_ij, d^k_ij]); aggregate the l DM matrices via IVIFWG operator with DM weights λ_k (Σ λ_k = 1) into the group IVIF decision matrix X̃ = [x̃_ij]_{m×n}. Then normalize entries per criterion type using Eqs. 12-15: benefit, cost, fixation, deviation: yielding IVIFN normalized matrix. Formül: X̃^(k) = (x̃^k_ij)_{m×n}, x̃^k_ij = ([a^k_ij, b^k_ij], [c^k_ij, d^k_ij]), μ⁺ + ν⁺ ≤ 1 x̃_ij = IVIFWG_λ(x̃^1_ij,...,x̃^l_ij) = ∏_{k=1}^l (x̃^k_ij)^{λ_k} [Eq.(11)] ⇒ a_ij = ∏_k (a^k_ij)^{λ_k}, b_ij = ∏_k (b^k_ij)^{λ_k} ⇒ c_ij = 1 − ∏_k (1 − c^k_ij)^{λ_k}, d_ij = 1 − ∏_k (1 − d^k_ij)^{λ_k} Benefit normalization: x̃_ij ↦ (x_ij − min_j) / (max_j − min_j) [Eq.(12)] Cost normalization: x̃_ij ↦ (max_j − x_ij) / (max_j − min_j) [Eq.(13)] Fixation: x̃_ij ↦ (max_{x⁺_j} − |x_ij − x⁺_j|) / max_{x⁺_j} [Eq.(14)] Deviation: x̃_ij ↦ (|x_ij − x⁻_j| − min_{x⁻_j}) / (max_{x⁻_j} − min_{x⁻_j}) [Eq.(15)] Anchor: Xue 2016 (ASC 38:703-713, DOI 10.1016/j.asoc.2015.10.010), Stage 1 Step 1, p.706 Eq.(11) + Eqs.(12)-(15)
2. 2.Adım 2 (F2): Step 2: Determine optimal criterion weights w* under incomplete weight information H = H_1 ∪ H_2 ∪ H_3 ∪ H_4 ∪ H_5 (Xue 2016 §4.2). If H is partial, solve linear-programming model M-1 (Eq. 19) maximizing total IVIF Hamming distance D(w). If H is completely unknown, solve M-2 (Eq. 20) via Lagrange method giving closed-form Eq. 21. When weights are externally supplied (e.g., from chained AHP/ENTROPY), skip this step. Formül: D_ij = (1/(m−1)) Σ_{g=1, g≠i}^m d_H(x̃_ij, x̃_gj), i=1,...,m; j=1,...,n [Eq.(16)] D_j = (1/(m−1)) Σ_i Σ_{g≠i} d_H(x̃_ij, x̃_gj), j=1,...,n [Eq.(17)] D(w) = Σ_j D_j w_j = (1/(m−1)) Σ_j Σ_i Σ_{g≠i} d_H(x̃_ij, x̃_gj) w_j [Eq.(18)] M-1: max D(w) s.t. w ∈ H, Σ_j w_j = 1, w_j ≥ 0 [Eq.(19)] M-2 (completely unknown H): [Eq.(20)] w_j = (Σ_i Σ_{g≠i} d_H(x̃_ij, x̃_gj)) / Σ_j Σ_i Σ_{g≠i} d_H(x̃_ij, x̃_gj) [Eq.(21)] d_H(α̃_1, α̃_2) = (1/4)(|a_1−a_2| + |b_1−b_2| + |c_1−c_2| + |d_1−d_2|) [Eq.(6)] Anchor: Xue 2016, Stage 2 Step 2, p.707 Eqs.(16)-(21) + Eq.(6) Hamming distance
3. 3.Adım 3 (F3): Step 3: Compute the weighted group IVIF decision matrix R̃ = (r̃_ij)_{m×n} by applying scalar-IVIFN multiplication (Eq. 22) to each entry x̃_ij of the normalized group matrix with λ = w_j. Formül: r̃_ij = w_j · x̃_ij = ([1 − (1 − a_ij)^{w_j}, 1 − (1 − b_ij)^{w_j}], [c_ij^{w_j}, d_ij^{w_j}]) [Eq.(22)] Anchor: Xue 2016, Stage 3 Step 3, p.708 Eq.(22)
4. 4.Adım 4 (F4): Step 4: Construct the Border Approximation Area (BAA) vector G̃ = [g̃_1, g̃_2, ..., g̃_n] by applying the IVIFG operator column-wise across the m alternatives (geometric mean of R̃). Formül: g̃_j = ∏_{i=1}^m (r̃_ij)^{1/m} [Eq.(23)] ⇒ a_{g_j} = ∏_i (a_{r_ij})^{1/m}, b_{g_j} = ∏_i (b_{r_ij})^{1/m} ⇒ c_{g_j} = 1 − ∏_i (1 − c_{r_ij})^{1/m}, d_{g_j} = 1 − ∏_i (1 − d_{r_ij})^{1/m} G̃ = [g̃_1, g̃_2, ..., g̃_n] [Eq.(24)] Anchor: Xue 2016, Stage 3 Step 4, p.708 Eqs.(23)-(24)
5. 5.Adım 5 (F5): Step 5: Compute the signed distance matrix D = (d_ij)_{m×n} between r̃_ij and the BAA element g̃_j using the IVIF Euclidean distance (Eq. 26). Sign is positive if r̃_ij ≥ g̃_j by the comparison rule (score then accuracy, Def 5), otherwise negative: interpreting whether the alternative lies above (upper area G⁺) or below (lower area G⁻) the BAA. Formül: d_E(α̃_1, α̃_2) = √( (1/4) · ((a_1−a_2)² + (b_1−b_2)² + (c_1−c_2)² + (d_1−d_2)²) ) [Eq.(26)] d_ij = d_E(r̃_ij, g̃_j) if r̃_ij ≥ g̃_j (i.e., score(r̃_ij) ≥ score(g̃_j)) [Eq.(25)] d_ij = −d_E(r̃_ij, g̃_j) if r̃_ij < g̃_j Score (Def 4 Eq.3): S(α̃) = (1/4)(2 + a − c + b − d) ∈ [0, 1] Accuracy (Def 4 Eq.4): H(α̃) = (a + b − 1) + (c + d)/2 ∈ [−1, 1] (used as tie-breaker) Anchor: Xue 2016, Stage 3 Step 5, p.708 Eqs.(25)-(26) + Def 4 Eq.(3)-(4)
6. 6.Adım 6 (F6): Step 6: Compute the closeness coefficient CC_i = Σ_j d_ij for each alternative i, and rank alternatives in descending order of CC_i. Higher CC_i means the alternative lies closer to (or above) the BAA, indicating better material/option. If CC_i > 0, A_i is in the upper area G⁺ (near ideal A⁺); if CC_i < 0, A_i is in the lower area G⁻ (near anti-ideal A⁻). Formül: CC_i = Σ_{j=1}^n d_ij, i = 1,...,m [Eq.(27)] Ranking: sort alternatives by descending CC_i. Anchor: Xue 2016, Stage 3 Step 6, p.708 Eq.(27)

Commonly paired with

• •IVIF-internal (F2 Eqs. 19-21) + IVIF-MABAC (common)
• •IF-ENTROPY + IVIF-MABAC (occasional)

How to cite