1. Validate IFN axioms (μ+ν ≤ 1) on every matrix entry. If multi-DM input is supplied, also verify DM weights λ on the l-simplex (Σλ=1). Construct the IF decision matrix (or k matrices for group decision making).
R(k)=(rij(k))m×n, rij(k)=(μij(k),νij(k)), μ+ν≤1, k∑λk=1
2. (Multi-DM only; identity for single-DM) Aggregate the k individual DM matrices R^(1), ..., R^(k) into a single collective IF decision matrix D̃ = (r̃_ij) using the Xu 2007 IFWA operator with DM weights λ. For single-DM input (dm_count=1) this step is the identity.
r~ij=IFWAλ(rij(1),…,rij(k))=(1−k∏(1−μij(k))λk, k∏(νij(k))λk)
3. Compute the IF entropy per criterion E^IFS_LT(C_j) using the Vlachos-Sergiadis 2007 measure (Hung-Chen 2010 Eq. 7). For each criterion j: sum over alternatives i of the four-term integrand [μ ln μ + ν ln ν − (1−π) ln(1−π) − π ln 2], scaled by −1/(m ln 2) so that E ∈ [0, 1]. Convention: x ln x = 0 when x = 0 (limit as x→0⁺).
ELTIFS(Cj)=−mln21i=1∑m[μijlnμij+νijlnνij−(1−πij)ln(1−πij)−πijln2]
4. Compute the divergence (information content) per criterion d_j = 1 − E^IFS(C_j). Higher d_j means lower entropy, hence higher information content and discrimination power.
dj=1−ELTIFS(Cj), j=1,…,n
5. Normalise the divergence vector to crisp weights on the n-simplex: w_j = d_j / Σ_k d_k. The output is a crisp weight vector w ∈ Δ^{n-1} satisfying Σw_j = 1, w_j ≥ 0.
wj=∑k=1ndkdj, j∑wj=1, wj≥0