MCDMAKER-logo

MCDM Methods

Step-by-Step Algorithms

PIV Method

Proximity Indexed Value

2018 Mufazzal and Muzakkir 5 Steps

PIV (Proximity Indexed Value) is a multi-criteria decision-making (MCDM) method that ranks alternatives based on their weighted proximity (deviation) from ideal values. It is computationally simple and specifically designed to minimize the rank reversal problem. Lower overall proximity index values indicate better alternatives.

Video Demonstration

Step-by-Step Algorithm

Calculated cell
Source cells in formula
1

Form the decision matrix

Create the decision matrix with $m$ alternatives and $n$ criteria :

\[ X=\begin{bmatrix} x_{11} & x_{12} & \cdots & x_{1n}\\ x_{21} & x_{22} & \cdots & x_{2n}\\ \vdots & \vdots & \ddots & \vdots\\ x_{m1} & x_{m2} & \cdots & x_{mn} \end{bmatrix} \]

$x_{ij}$ presents the performance value of ith alternative on jth criterion, m and n are the numbers of alternatives and criteria respectively.

Alternative$C_1$$C_2$$C_3$
$A_1$102030
$A_2$152535
$A_3$251535
Criterion type: C₁ Benefit C₂ Cost C₃ Benefit
Weights: $w_1=0.7279$ · $w_2=0.2009$ · $w_3=0.0712$ (Entropy method)
2

Normalize the decision matrix

Formula

The normalized value is calculated as :

$$ r_{ij}=\frac{x_{ij}}{\sqrt{\displaystyle\sum_{i=1}^{m}x_{ij}^{2}}} $$
Alternative$C_1$$C_2$$C_3$
$A_1$0.32440.56570.5185
$A_2$0.48670.70710.6049
$A_3$0.81110.42430.6049
Denominators: $C_1$: $\sqrt{950}\approx30.8221$ · $C_2$: $\sqrt{1250}\approx35.3553$ · $C_3$: $\sqrt{3350}\approx57.8792$
3

Construct the weighted normalized decision matrix

Formula

Multiply each normalized value by the corresponding criterion weight:

$$ v_{ij}=w_j\,r_{ij} $$

The weighted normalized matrix is :

$$ V=[v_{ij}]_{m\times n} $$

Where $w_j$ is the weight of criterion $j$.

Using weights: $w_1=0.7279$, $w_2=0.2009$, $w_3=0.0712$

Alternative$C_1$ (B) $C_2$ (C) $C_3$ (B)
$A_1$0.23610.11360.0369
$A_2$0.35430.14210.0431
$A_3$0.59040.08520.0431
4

Weighted proximity index

Formula

Calculate the proximity value according to the type of criterion :

For benefit criteria :

$$ u_{ij}=v_{\max}-v_{ij} $$

For cost criteria :

$$ u_{ij}=v_{ij}-v_{\min} $$

Where $v_{ij}$ is the weighted normalized value of alternative $A_i$, $v_{\max}$ is the maximum weighted normalized value, and $v_{\min}$ is the minimum weighted normalized value.

Alternative$C_1$ ($v_{\max}=0.5904$) $C_2$ ($v_{\min}=0.0852$) $C_3$ ($v_{\max}=0.0431$)
$A_1$0.35430.02840.0062
$A_2$0.23610.05690.0000
$A_3$0.00000.00000.0000
5

Overall proximity value and ranking

Formula

Sum the proximity values across all criteria :

$$ d_i=\sum_{j=1}^{n}u_{ij} $$

Rank the alternatives according to their overall proximity values in ascending order :

$$ d_i < d_k \quad\Longrightarrow\quad A_i >A_k $$
AlternativeProximity Value ($d_i$)
$A_1$0.3889
$A_2$0.2930
$A_3$0.0000
Proximity values (lower is better): $d_3=0.0000 < d_2=0.2930 < d_1=0.3889$
Final ranking: $A_3 \succ A_2 \succ A_1$

PIV Algorithm Flowchart