MCDMAKER-logo

MCDM Methods

Step-by-Step Algorithms

WPM Method

Weighted Product Model

1969 D.W. Miller and M.K. Starr 4 Steps

WPM (Weighted Product Model) is a multiplicative MCDM method that evaluates alternatives by multiplying criterion performance ratios, with each ratio raised to the corresponding criterion weight.

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

Normalize the criterion values so that all criteria become comparable and a higher normalized value indicates better performance.

For benefit criteria :

\[ r_{ij}=\frac{x_{ij}} {\displaystyle\max_i x_{ij}} \]

For cost criteria :

\[ r_{ij}=\frac{\displaystyle\min_i x_{ij}} {x_{ij}} \]

\(r_{ij}\) is the normalized value of alternative \(A_i\) for criterion \(C_j\).

C₁ and C₃ are benefit criteria (divide by max). C₂ is a cost criterion (divide min by value).

Alternative$C_1$ (Benefit)$C_2$ (Cost)$C_3$ (Benefit)
$A_1$0.40000.75000.8571
$A_2$0.60000.60001.0000
$A_3$1.00001.00001.0000
3

Calculate the weighted normalized decision matrix

Formula

Raise each normalized criterion value to the power of its corresponding criterion weight :

$$ v_{ij}=\left(r_{ij}\right)^{w_j} $$

where \(w_j\) is the weight of criterion \(C_j\).

$$ \sum_{j=1}^{n}w_j=1, \qquad w_j\geq0 $$

The resulting matrix is the weighted normalized decision matrix:

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

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

Alternative$C_1$$C_2$$C_3$
$A_1$0.51320.94390.9891
$A_2$0.68930.90251.0000
$A_3$1.00001.00001.0000
4

WPM score and ranking

Formula
\[ Q_i^{WPM}=\prod_{j=1}^{n} v_{ij} \]

\(Q_i^{WPM}\) is the WPM score of alternative \(A_i\). The multiplicative structure means that the performance of all criteria contributes to the final score.

Rank the alternatives according to their WPM scores in descending order.

\[ Q_{(1)}^{WPM} \geq Q_{(2)}^{WPM} \geq \cdots \geq Q_{(m)}^{WPM} \]
AlternativeWPM Score ($Q_i^{WPM}$)
$A_1$0.4787
$A_2$0.6221
$A_3$1.0000
WPM scores: $Q_3^{WPM}=1.0000 >Q_2^{WPM}=0.6221 >Q_1^{WPM}=0.4787$
Final ranking: $A_3 \succ A_2 \succ A_1$

WPM Algorithm Flowchart