LPF-CRITIC-EDAS - Linguistic Pythagorean Fuzzy EDAS with CRITIC weighting (Akram-Ramzan-Deveci 2023)
1. Form per-DM linguistic Pythagorean fuzzy decision matrices D^(t) = [d^(t)_pq], where d^(t)_pq = (I_ψ_pq^t, I_ζ_pq^t), ψ²+ζ² ≤ τ², for each decision-maker t = 1,…,T.
2. Aggregate across DMs via LPFHWA (Hamacher weighted average, Akram 2023 Theorem 3.1) with DM weights Γ = (γ_1,…,γ_T): α̃_pq = LPFHWA_Γ(d^(1)_pq,…,d^(T)_pq). At κ=1 (algebraic) this simplifies to ψ̃² = τ²·(1 − ∏_t(1 − (ψ^t/τ)²)^{γ_t}) and ζ̃ = τ·∏_t(ζ^t/τ)^{γ_t}.
3. CRITIC weights ϖ_r for criteria from the aggregated LPF matrix. (i) Score S(α̃_pq) = √((τ²+ψ̃²−ζ̃²)/2) (Eq.4.3). (ii) Direction-aware standardization E_pr ∈ [0,1] (Eq.4.4): benefit (BA) E_pr = (S_pr − S^−_r)/(S^+_r − S^−_r); cost (CA) E_pr = (S^+_r − S_pr)/(S^+_r − S^−_r). (iii) Correlation λ_{rk} between columns r and k (Eq.4.5). (iv) σ_r = std-dev of column r (Eq.4.6). (v) Information content γ_r = σ_r · Σ_k(1 − λ_{rk}) (Eq.4.7). (vi) Normalize ϖ_r = γ_r / Σ_k γ_k (Eq.4.8); Σ ϖ_r = 1.
4. Compute the LPF Average Solution δ̃ = (δ̃_1,…,δ̃_n) by per-criterion LPFAWA with equal alternative weights 1/m: δ̃_q = LPFAWA_{1/m}(α̃_{1q},…,α̃_{mq}).
5. Positive/Negative Distance from AVS using LPFN subtraction (Eq.2.8) and scalar multiplication (Eq.2.11) with direction-aware sign. For benefit criteria: PDA_pq = (α̃_pq ⊖ δ̃_q)/S(δ̃_q) if α̃_pq ≥ δ̃_q else 0̃; NDA_pq symmetric. For cost criteria the roles swap. Division by S(δ̃_q) is the LPFN scalar mult by 1/S(δ̃_q) (Eq.2.11).
6. Weighted positive/negative LPF distances per alternative via CRITIC weights ϖ_r: WPDA_p = ⊕_q (ϖ_q · PDA_pq); WNDA_p = ⊕_q (ϖ_q · NDA_pq), where ⊕ is LPFN Hamacher addition (Eq.2.9) and ϖ·α is LPFN scalar multiplication (Eq.2.11). At κ=1 these are the algebraic LPFAWA aggregates.
7. Defuzzify WPDA/WNDA via score (Eq.4.3): wsp_p = S(WPDA_p), wsn_p = S(WNDA_p). Normalize: NSP_p = wsp_p / max_p wsp_p; NSN_p = 1 − wsn_p / max_p wsn_p.
8. Appraisal Score S_q^A = (NSP_p + NSN_p)/2 ∈ [0,1].
9. Rank alternatives in descending order of S^A_p (largest = best).