Extension card · q-Rung Orthopair
q-Rung orthopair PROMETHEE (Akram and Shumaiza, 2021)
This is the form of PROMETHEE for situations where criterion scores are given as a pair of support and rejection degrees (μ, ν) for a judgement, and this pair does not fit the intuitionistic or Pythagorean constraint. Each pair is first reduced to a single score, and classical pairwise comparison then runs on these scores.
Base method
PROMETHEE →
Philosophy, mechanics, strengths and weaknesses are on the base method card; this card describes only the difference.
Data type (family)
q-Rung Orthopair →
What this data type is, when to use it, how to write it in a cell: the family's full account is here.
What Changes from the Base Method?
Three things change; the pairwise comparison and net-flow logic do not.
Cells. In crisp PROMETHEE every cell is a single number. Here every cell is a (μ, ν) pair: μ the support degree, ν the rejection degree. The pair's μ^q + ν^q sum cannot exceed 1; q is fixed, the user does not enter it, it comes bundled with the method's definition.
Score first, then preference. Before entering the pairwise comparison, every (μ, ν) pair is reduced to a single number by Yager's score formula: s = (1 + μ^q − ν^q) / 2. This matches the common pattern across the PROMETHEE family; uncertainty is not carried into the distance calculation but descends to a single number before the preference calculation. The preference function operates on these scores in its plainest form (the usual criterion): if one score is higher than another, preference is total, otherwise there is no preference at all.
No intermediate step. In crisp PROMETHEE, thresholded preference functions (an indifference and a preference threshold) can be chosen. In this extension only the plainest function is used; even the smallest score gap counts as total preference.
DecisionMind fixes q and the score formula in this extension; weights and direction information come from outside.
How to Read the Output
What stays the same as the base method is that the result is again a net flow and a complete ranking. The difference lies here: this net flow is no longer computed from the raw (μ, ν) pairs but from their scores, already reduced to single numbers.
Because any score gap, however small, counts as total preference, a small rounding in the input can flip a preference from 0 to 1. This sensitivity should be kept in mind when reporting the net-flow difference between two alternatives.
Thus instead of writing:
"According to q-rung PROMETHEE, A3 is the best alternative"
the report should read:
"A3's score is the most preferred in the pairwise comparisons under the chosen q and weights; because the plainest preference function is used, small score gaps have also been counted as total preference"
When to Prefer This over the Base Method
Use this when experts report both strong support and strong reservation for a judgement, and this pair also exceeds the Pythagorean constraint. The q-rung orthopair data-type card explains how this constraint is determined; q is, again, not chosen by the user here, it comes bundled with the method.
If expert pairs already fit the intuitionistic or Pythagorean constraint there is no need to move to this extension; a large q only reduces discriminating power. q-rung and Pythagorean structures should not be confused: both ask the same question, they differ only in the constraint they accept.
Mistakes Specific to This Extension
Using a different q in different cells. The constraint is checked with a single q for the whole matrix. A pair valid at q = 3 in one cell can turn out invalid if the rest of the matrix is evaluated at q = 1.
Forgetting that small roundings can change a preference. The plainest preference function has no threshold; even a thousandth of a difference between scores counts as total preference. If input precision is low, this artificially sharpens the ranking.
Assuming uncertainty is carried through to the pairwise comparison. Uncertainty descends to a score at the very first step, before the preference calculation. The remaining steps are the same as crisp PROMETHEE; the width of the (μ, ν) pair does not enter the result directly, it only determines the score.
The governing principle is this:
q-Rung orthopair PROMETHEE records, with q, judgements where both the support and the rejection degree can be high; but once this pair is reduced to a single Yager score, every remaining step works exactly like crisp PROMETHEE.
Cases
The first case is a literature case: a portion of the subcontractor-selection example in Akram and Shumaiza's (2021) paper. The second case is fictional.
1. Construction: Evaluating eight subcontractor candidates on ten criteria (Akram and Shumaiza, 2021)
A construction employer evaluates eight subcontractor candidates (a1 to a8) on ten criteria: technical competence, training skills, reputation, financial standing, organisational skills, experience, reliability, safety, past performance record and quality assurance. All criteria are "more is better." Every cell is a (μ, ν) pair drawn from pooled expert assessments; because the most extreme pairs exceed q = 2, rung q = 3 was chosen.
Three of the ten criteria are shown below as an example; the engine's input is all ten criteria.
| Candidate | Technical competence | Experience | Safety |
|---|---|---|---|
| a1 | (0.734; 0.579) | (0.468; 0.809) | (0.730; 0.538) |
| a3 | (0.512; 0.737) | (0.483; 0.796) | (0.633; 0.607) |
| a8 | (0.501; 0.742) | (0.567; 0.731) | (0.666; 0.579) |
| Weight | 0.113 | 0.082 | 0.143 |
The method first reduces every cell to a Yager score, then compares each candidate pair with the plainest preference function, builds the weighted overall preference index, and sums the incoming and outgoing flows.
| Candidate | Φ+ (incoming) | Φ- (outgoing) | Φ (net flow) | Rank |
|---|---|---|---|---|
| a8 | 0.686 | 0.299 | 0.388 | 1 |
| a3 | 0.600 | 0.332 | 0.268 | 2 |
| a1 | 0.503 | 0.447 | 0.055 | 3 |
| a5 | 0.477 | 0.486 | -0.008 | 4 |
| a6 | 0.445 | 0.528 | -0.084 | 5 |
| a2 | 0.422 | 0.565 | -0.144 | 6 |
| a4 | 0.412 | 0.575 | -0.163 | 7 |
| a7 | 0.337 | 0.650 | -0.313 | 8 |
The result reads as follows. a8 ranks first because it carries high support degrees on heavily-weighted criteria such as safety and past performance. a3 ranks second, and the gap to a1 (0.268 against 0.055) is marked. a7, with the lowest net flow, carries a lower support or higher rejection degree than the others on most criteria.
The employer's hesitation: two cells in the paper's own table, between a1 and a7 and between a1 and a5, contradict another of the paper's own tables. Once these two cells are corrected according to the paper's own internal consistency and the calculation independently redone, the net flow of a1, a5 and a7 changes by only 0.014, and the ranking does not change. This shows that small data errors do not immediately upset the result, but they must still be checked.
In the report: "Eight subcontractor candidates were evaluated on ten criteria at q = 3; a8 comes out clearly first (Φ = 0.388); a3 is second and the gap is not small."
Source: Akram, M., & Shumaiza (2021), Section 4 subcontractor-selection example, Tables 5-8, pp. 117-121. The weighted matrix is taken from the paper's own Table 5; net flows were recomputed independently by running the engine, and matched exactly the ranking published by the paper (a8, a3, a1, a5, a6, a2, a4, a7).
2. Textiles: A yearly-contract decision among three fabric suppliers
A clothing manufacturer will choose its main supplier for the year among three fabric suppliers. Criteria: production capacity, quality consistency and delivery performance; all three are "more is better." The expert team has given every supplier both a support and a rejection degree on every criterion; one supplier's capacity criterion was reported with both a very high support and a marked rejection degree, and since this pair exceeds the Pythagorean constraint, q = 3 was chosen.
The method reduces every cell to a score, builds the weighted preference index and computes the net flows. Suppose the supplier with the highest capacity but also the highest quality reservation stays second, because the weight on quality consistency is kept high; the supplier with middling capacity but balanced support on every criterion comes out first.
The manufacturer's hesitation: would the order change if the capacity weight were raised slightly? The strength of the supplier with the highest capacity is concentrated in a single criterion; the balanced supplier's advantage is spread across more than one criterion and appears more resilient to weight changes.
In the report: "The supplier with a balanced support profile comes out clearly first; the advantage of the supplier with the highest capacity rests on a single criterion and is therefore more fragile to weight changes."
3. What Not to Do
In the subcontractor table, entering a1's technical-competence pair as (0.734; 0.579) and choosing q = 2 based on this single cell, while ignoring that the constraint at q = 2 is exceeded elsewhere in the matrix (for instance in a8's safety pair), is wrong; q is chosen once for the whole matrix. The second error is calculating the scores and then rounding the difference between them as "small, negligible" and treating them as equal; the plainest preference function counts every positive difference as total preference, and rounding can change the ranking. The third error is deriving the rejection degree from the support degree (ν = 1 − μ). In that case the sum is always exactly 1 and q = 1 already suffices; raising q then serves no purpose.
Sources
For the formulas behind each step, the intermediate tables and citation formats, see the DecisionMind method page: decisionmind.app/library/qr-promethee
Akram, M., & Shumaiza (2021). Multi-criteria decision making based on q-rung orthopair fuzzy promethee approach. Iranian Journal of Fuzzy Systems, 18(5), 107–127. DOI: 10.22111/IJFS.2021.6258
Yager, R. R. (2017). Generalized orthopair fuzzy sets. IEEE Transactions on Fuzzy Systems, 25(5), 1222–1230. DOI: 10.1109/TFUZZ.2016.2604005
Brans, J. P., & Vincke, Ph. (1985). A preference ranking organisation method (The PROMETHEE method for multiple criteria decision-making). Management Science, 31(6), 647–656. DOI: 10.1287/mnsc.31.6.647
Liu, P., & Wang, P. (2018). Some q-rung orthopair fuzzy aggregation operators and their applications to multiple-attribute decision making. International Journal of Intelligent Systems, 33(2), 259–280. DOI: 10.1002/int.21927