Ranking
BF-COPRAS: Bipolar extension of COPRAS
0Overview
Bipolar outranking/ranking: Bipolar Fuzzy Set (BFS: positive membership μ⁺ ∈ [0,1], negative μ⁻ ∈ [-1,0]). Output typically utility (higher value = preferred).
Strengths
- •Method-specific: Bipolar outranking/ranking: Bipolar Fuzzy Set (BFS: positive membership μ⁺ ∈ [0,1], negative μ⁻ ∈ [-1,0])
- •Preserves bipolar_fuzzy 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 base; cf. Belton-Gear 1983, Wang-Luo 2009)
- •Assumes: Decision matrix entries are valid Bipolar Fuzzy numbers/tuples
- •Assumes: Underlying crisp method's compensation assumption holds in uncertain space
- •Assumes: All decision-maker(s) and experts use the same linguistic/uncertainty scale
Method assistant
Grounded explanations: it explains the method, it does not compute.
Assumptions to verify
- •Decision matrix entries are valid Bipolar Fuzzy numbers/tuples
- •Underlying crisp method's compensation assumption holds in uncertain space
- •All decision-maker(s) and experts use the same linguistic/uncertainty scale
When not to use
- •Crisp data sufficient: use base COPRAS directly (avoid unnecessary uncertainty layer)
- •Aggregation operator (PFWA/PFOWA/etc.) not specified: output ambiguous
Edge cases
- •See F.steps and D.parameters for BF-COPRAS-specific edge handling. recommendation_metadata.assumptions_to_verify also lists boundary conditions.
Common pitfalls
- •Hatalı: 'BF-COPRAS bu varsayımı kontrol etmeden uygulamak'. Doğrusu: Decision matrix entries are valid Bipolar Fuzzy numbers/tuples
- •Hatalı: 'BF-COPRAS bu varsayımı kontrol etmeden uygulamak'. Doğrusu: Underlying crisp method's compensation assumption holds in uncertain space
- •Hatalı: 'BF-COPRAS bu varsayımı kontrol etmeden uygulamak'. Doğrusu: All decision-maker(s) and experts use the same linguistic/uncertainty scale
- •Hatalı: BF-COPRAS'yi 'Crisp data sufficient' durumunda kullanmak: recommendation_metadata.not_recommended_when alternatif öneriyor.
- •Hatalı: BF-COPRAS'yi 'Aggregation operator (PFWA/PFOWA/etc.) not specified' durumunda kullanmak: recommendation_metadata.not_recommended_when alternatif öneriyor.
Worked example
- 1.Adım 1 (F1): Step 0: Construct bipolar fuzzy decision matrix B = [(μ⁺_ij, ν⁻_ij)]. Normalize cost criteria via BFN complement: (1−μ⁺, |ν⁻|−1). Convert all BFNs to crisp scores using score function Δ(B)=(1+μ⁺+ν⁻)/2 ∈ [0,1]. All subsequent steps operate on the resulting crisp score matrix x_ij = Δ(B*_ij). Formül: \Delta(B) = \dfrac{1 + \mu^+ + \nu^-}{2} \in [0,1] \\[4pt] B^*_{ij} = \begin{cases}(\mu^+_{ij}, \nu^-_{ij}) & j \in J^+ \\ (1-\mu^+_{ij}, |\nu^-_{ij}|-1) & j \in J^- \end{cases} \\[4pt] x_{ij} = \Delta(B^*_{ij}) Anchor: Wei et al. 2018b: BFN score function Eq.(2); Jana & Pal 2021: cost normalization Eq.(7)
- 2.Adım 2 (F2): Step 1: Linear sum normalisation r_ij = x_ij / Σ x_kj. Formül: r_{ij} = \dfrac{x_{ij}}{\sum_{k=1}^{m} x_{kj}} Anchor: Zavadskas-Kaklauskas 1996, Eq.(2)
- 3.Adım 3 (F3): Step 2: Weighted normalised matrix d_ij = w_j · r_ij. Formül: d_{ij} = w_{j} \cdot r_{ij} Anchor: Zavadskas-Kaklauskas 1996, Eq.(3)
- 4.Adım 4 (F4): Step 3: Sum benefit S+_i and cost S−_i. Formül: S^{+}_{i} = \sum_{j\in J^{+}} d_{ij},\quad S^{-}_{i} = \sum_{j\in J^{-}} d_{ij} Anchor: Zavadskas-Kaklauskas 1996, Eqs.(4)-(5)
- 5.Adım 5 (F5): Step 4: Relative significance Q_i (Zavadskas-Kaklauskas compound). Formül: Q_{i} = S^{+}_{i} + \dfrac{\min_{k} S^{-}_{k}\cdot \sum_{k} S^{-}_{k}}{S^{-}_{i}\cdot \sum_{k} \dfrac{\min_{k} S^{-}_{k}}{S^{-}_{k}}} Anchor: Zavadskas-Kaklauskas 1996, Eq.(6)
- 6.Adım 6 (F6): Step 5: Utility degree N_i (percent of best) and descending ranking. Formül: N_{i} = \dfrac{Q_{i}}{\max_{k} Q_{k}} \times 100\% Anchor: Zavadskas-Kaklauskas 1996, Eq.(7)
Commonly paired with
- •n_a + BF-COPRAS (common)
How to cite
. UNCONFIRMED: BF-COPRAS specific seminal not confirmed via systematic literature search. PENDING.