Simple Additive Weighting (SAW) Method

A Master Guide to Multi-Criteria Decision-Making (MCDM)

1. Introduction

The Simple Additive Weighting (SAW) method, also universally referred to as the Weighted Sum Model (WSM), is one of the most fundamental, intuitive, and frequently utilized techniques in Multi-Criteria Decision-Making (MCDM).
In the real world, decision-makers are constantly forced to choose between multiple alternatives based on several, often conflicting, criteria (e.g., maximizing quality while minimizing cost). SAW resolves this by converting distinct qualitative and quantitative metrics into a single, comparable, dimensionless preference score.

Key Features

• Intuitive: Exceptionally straightforward to explain to stakeholders and non-technical teams.
• Computationally Efficient: Low algorithmic complexity makes it instantly scalable to thousands of alternatives.
• Versatile: Seamlessly accommodates both quantitative data (e.g., price, weight) and qualitative data (e.g., expert satisfaction ratings).

Common Core Applications

• Supply Chain Management: Vendor and third-party logistics (3PL) supplier evaluations.
• Human Resources: Objective applicant matching, recruitment scoring, and internal promotion matrices.
• Operations & IT: Hardware equipment benchmarking and software architecture selections.
• Strategic Planning: Project prioritization, capital budgeting, and resource allocation.
• Academic Administration: Standardized student scholarship allocation and performance indexing.

2. Mathematical Foundation & Process Flow

The core mechanism of SAW relies on a linear combination of normalized criteria scores multiplied by their respective importance weights.

The Core Formula

The overall preference score (V_i) for an alternative (A_i) is calculated using the following equation:
Where:

• V_i = The final integrated preference score of alternative i.
• w_j = The relative weight of importance assigned to criterion j.
• r_{ij} = The normalized value of alternative i with respect to criterion j.
• n = The total number of decision criteria.

Decision Rule: The alternative that yields the highest final score (V_{\max}) is designated as the mathematically optimal choice.

3. Step-by-Step Implementation Procedure

[Identify Criteria] ➔ [Assign Weights] ➔ [Build Decision Matrix] ➔ [Normalize Matrix] ➔ [Calculate Weighted Scores] ➔ [Sum & Rank]  
  

Step 1: Identify Alternatives and Criteria

Define the set of alternatives to evaluate and determine the independent factors (C_j) that will influence the choice. These criteria must be explicitly categorized into:

• Benefit Criteria: Higher values are preferred (e.g., Profit, Quality, Efficiency).
• Cost Criteria: Lower values are preferred (e.g., Price, Risk, Delivery Time).

Step 2: Assign Importance Weights

Assign an importance weight (w_j) to each criterion.

• Strict Operational Condition: The sum of all weights across the system must equal exactly 1.00 (or 100%).

Step 3: Construct the Raw Decision Matrix (X)

Evaluate every alternative (A_i) against every criterion (C_j). This creates an m \times n matrix where x_{ij} represents the raw performance value.

Step 4: Normalize the Decision Matrix

Because criteria use completely different scales of measurement (e.g., dollars vs. a 1–10 rating scale), raw data must be mapped into a dimensionless scale between 0 and 1.

• Formula A: For Benefit Criteria (Higher is Better)

• Formula B: For Cost Criteria (Lower is Better)

Step 5: Calculate Weighted Normalized Scores

Multiply each normalized value (r_{ij}) by its designated criterion importance weight (w_j).

Step 6: Compute Final Scores (V_i)

Sum up the individual weighted results across all criteria for each alternative to find its total value (V_i).

Step 7: Rank and Select

Sort the alternatives in descending order based on their final scores. The highest-scoring alternative is selected.

4. Fully Worked Illustrative Example

Problem Statement: A corporate logistics company needs to select the single best third-party supplier from three candidates (Supplier A, B, and C) based on four distinct performance parameters.

Phase I: Metadata and Weights Setup

The executive board establishes the following criteria framework:

1. Cost (Cost Criterion, Lower is Better) \rightarrow Weight: 0.30
2. Quality (Benefit Criterion, Higher is Better) \rightarrow Weight: 0.40
3. Delivery Time (Cost Criterion, Lower is Better) \rightarrow Weight: 0.20
4. Service Rating (Benefit Criterion, Higher is Better) \rightarrow Weight: 0.10

Phase II: Constructing the Raw Decision Matrix (X)

Alternative (Supplier)	Cost (C_1) [USD]	Quality (C_2) [Score 1-100]	Delivery Time (C_3) [Days]	Service (C_4) [Score 1-10]
Supplier A	100	85	7	8
Supplier B	120	94	9	8
Supplier C	110	76	6	9
Matrix Extremes	\min = 100	\max = 94	\min = 6	\max = 9

Phase III: Matrix Normalization (r_{ij})

• Cost Normalization (Cost Type \rightarrow \min / x_{ij}):
  • Supplier A: \frac{100}{100} = 1.000
  • Supplier B: \frac{100}{120} \approx 0.833
  • Supplier C: \frac{100}{110} \approx 0.909
• Quality Normalization (Benefit Type \rightarrow x_{ij} / \max):
  • Supplier A: \frac{85}{94} \approx 0.904
  • Supplier B: \frac{94}{94} = 1.000
  • Supplier C: \frac{76}{94} \approx 0.809
• Delivery Time Normalization (Cost Type \rightarrow \min / x_{ij}):
  • Supplier A: \frac{6}{7} \approx 0.857
  • Supplier B: \frac{6}{9} \approx 0.667
  • Supplier C: \frac{6}{6} = 1.000
• Service Normalization (Benefit Type \rightarrow x_{ij} / \max):
  • Supplier A: \frac{8}{9} \approx 0.889
  • Supplier B: \frac{8}{9} \approx 0.889
  • Supplier C: \frac{9}{9} = 1.000

Phase IV: Applying Weights and Calculating Final Scores (V_i)

• Supplier A:

• Supplier B:

• Supplier C:

Phase V: Final Ranking Matrix

Rank	Alternative	Final Score (V_i)	Business Decision
1	Supplier A	0.922	Selected / Optimal Option
2	Supplier C	0.897	Backup Option
3	Supplier B	0.872	Eliminated

5. Analytical Evaluation of SAW

Like any mathematical model, SAW comes with structural trade-offs that decision-makers must consider.

Advantages

• Proportional Integrity: The normalization linear methods cleanly preserve relative differences among baseline data metrics without distorting scale intervals.
• Frictionless Deployment: The basic linear math means it can be effortlessly written directly into standard software platforms without specialized libraries:
  • Spreadsheets: Microsoft Excel or Google Sheets.
  • Programming Data Frames: Python (pandas/numpy), R, or MATLAB.
• Transparency: Stakeholders can cleanly see exactly how an alternative's weak score in one metric is actively compensated for by high performance in another metric.

Limitations

• Assumption of Independence: SAW assumes all chosen criteria are entirely independent of one another. In real-world dynamics, variables often interact (e.g., scaling up Quality usually forces a corresponding inflation in Cost).
• Linear Scale Preference Bias: The model treats human preference updates as perfectly linear. It fails to adequately track complex psychological trade-offs or non-linear thresholds (e.g., an executive might accept variations in price up to a sudden hard budget ceiling, where utility drops to zero instantly).
• Extreme Weight Sensitivity: Small, subjective shifts or typos in the weights allocation layer can drastically shift the final ranks output.
• Normalization Vulnerability: Relying on different mathematical scaling types (such as Vector Normalization or Min-Max scaling) can sometimes lead to rank reversal anomalies.

6. Summary Conclusion

The Simple Additive Weighting method acts as an incredibly reliable operational anchor for Multi-Criteria Decision-Making:
While its foundational mathematical simplicity is its absolute greatest asset, operators must approach weight assignment systematically (often using sub-frameworks like the Analytic Hierarchy Process—AHP—or Delphi consensus panels) to guarantee defensible, accurate, and completely unbiased decision pathways. For complex environments plagued by heavy ambiguity, modern researchers frequently merge SAW with fuzzy logic parameters to mitigate traditional data uncertainty limitations.