Extension card · q-Rung Orthopair
q-Rung orthopair VIKOR (Erdebilli et al., 2023)
This is the form of VIKOR for situations where an expert assigns a judgement both strong support and a strong reservation at once. It is used when the sum of the two exceeds the intuitionistic or Pythagorean bound; it still gives its result as the same triad of group utility, individual regret and the compromise index.
Base method
VIKOR →
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?
Four things change. The decision logic stays the same.
Cells. In crisp VIKOR every cell is a single number. Here every cell is a pair: support degree μ and rejection degree ν. The sum of the third powers of these two degrees cannot exceed 1, because DecisionMind fixes q at 3 in this method. The user does not choose q. Weights and the compromise coefficient v come from outside as single numbers.
Scale equalisation. In crisp VIKOR each criterion's best and worst value is read directly off the column. Here the support and rejection degree are first swapped for a cost criterion, so that every criterion is read in the benefit direction. Then each criterion's ideal pair and anti-ideal pair are chosen, not by comparing single numbers one by one, but by a score function. This score declares a real alternative's pair the best or the worst on that criterion.
Distance. Every alternative's normalised gap on every criterion is measured against that criterion's ideal pair with a three-component distance. This distance is then divided by the range between the ideal and the anti-ideal. In crisp VIKOR this gap was the ratio of a single difference. Here the gap is a distance ratio into which the support, rejection and hesitancy components enter together.
Result and defuzzification. Group utility S, individual regret R and the compromise index Q carry the same definition. A smaller Q is better. The method does not discard uncertainty at the outset; uncertainty is carried through to the gap calculation and descends to a single number when S, R and Q are computed. Both acceptance conditions work exactly as in classical VIKOR.
DecisionMind fixes, for this method, the ideal and anti-ideal pairs as the pair of a real alternative selected by the score function. In the literature it is also possible to take the highest support and lowest rejection degree separately, criterion by criterion. The two approaches give the same result if one alternative dominates on every criterion; if none dominates, they can give a different result.
How to Read the Output
The triad of Q, S and R is read as in crisp VIKOR. A smaller Q is better, and the gap between the single compromise solution and the compromise set is determined by two conditions. The difference lies here. Beneath the three of them there now sits a tension between support and rejection, and this tension descends to a single number and disappears when S and R are calculated.
If an expert gave both high support and high reservation on a criterion, that alternative's normalised gap on that criterion takes a middling value. The report does not show where this middling value comes from. The report should therefore note not only Q, S and R but also on which criterion the gap between support and rejection is small.
Thus instead of writing:
"According to q-rung VIKOR, the compromise solution is A2"
the report should read:
"With these weights and v = 0.5, A2 is the single compromise solution; on the criteria where A2 is strong, the gap between support and rejection is also large"
Carrying the uncertainty through does not make Q more accurate, it only keeps it from staying hidden.
When to Prefer This over the Base Method
Use this extension when an expert gives a judgement both strong support and a strong reservation at once, and this pair exceeds both the intuitionistic and the Pythagorean bound. Which pair exceeds which bound is shown by the short decision rule on the q-Rung data-type card. If the pair already fits within the intuitionistic or Pythagorean bound there is no need to raise q.
Converting an already-measured criterion into this form is wrong. In DecisionMind the table must be of a single type throughout. If a measured criterion is present, it too is entered as a fixed pair, and that pair carries no uncertainty. The exit condition of the base VIKOR holds here too: if no compromise is acceptable on one criterion, a method working on elimination logic should be preferred over the VIKOR family.
Mistakes Specific to This Extension
Entering data without checking the constraint. In every cell, the sum of the third powers of the support and rejection degrees cannot exceed 1.
Reading Q's direction in reverse. A smaller Q is always better. Some q-ROF VIKOR papers include the phrase "rank from largest to smallest," but this phrase contradicts the paper's own formula. DecisionMind follows classical VIKOR's rule that a smaller Q is better; reversing this rule turns the whole ranking on its head.
Confusing the ideal-pair selection. DecisionMind takes the ideal pair as the pair of a real alternative selected by a score function. Instead, separately collecting the highest support and lowest rejection degree on each criterion to build an artificial pair can give a different result. If none of the alternatives dominates, this difference shows up in the S and R values.
Skipping the two conditions and writing down only the alternative with the smallest Q. VIKOR's defining feature is the compromise set. In the illustrative example below both conditions happen to hold, but this will not be true of every table.
The governing principle is this:
q-Rung orthopair VIKOR exists to carry the tension between support and rejection through to the last step. Any application that disregards the rejection degree, confuses the direction of Q, or skips the two conditions erases this extension's own contribution.
Cases
The first case is DecisionMind's validation example. Because the three alternatives closely outrank one another on every criterion, the result comes out sharp at the extremes. This example is not taken from a book or a paper page; it was produced by running the engine itself. The second case is an illustrative construction.
1. Illustrative example: Three candidates evaluated on three criteria (DecisionMind's validation example)
All three criteria face the benefit direction, and their weights are 0.40, 0.35 and 0.25 respectively. The compromise coefficient is left at v = 0.5. A1's support degree is higher than A2's on every criterion, and its rejection degree is lower than A2's. The same relationship holds between A2 and A3.
| Candidate | C1 (μ, ν) | C2 (μ, ν) | C3 (μ, ν) |
|---|---|---|---|
| A1 | 0.90 · 0.20 | 0.85 · 0.30 | 0.80 · 0.40 |
| A2 | 0.70 · 0.40 | 0.65 · 0.50 | 0.60 · 0.55 |
| A3 | 0.50 · 0.55 | 0.45 · 0.60 | 0.40 · 0.65 |
| Direction | more is better | more is better | more is better |
| Weight | 0.40 | 0.35 | 0.25 |
The method selects the ideal pair and the anti-ideal pair for every criterion with a score function. A1 sits at the ideal point because it takes the highest score on every criterion. Every candidate's normalised gap is calculated, summed with the weights to give group utility S, and its largest value gives individual regret R.
| Candidate | S | R | Q | Rank |
|---|---|---|---|---|
| A1 | 0.000 | 0.000 | 0.000 | 1 |
| A2 | 0.665 | 0.266 | 0.666 | 2 |
| A3 | 1.000 | 0.400 | 1.000 | 3 |
The result reads as follows. A1 is best both overall and on its worst criterion, because it takes both higher support and lower rejection on every criterion; its Q is 0. A3 sits in exactly the opposite position, and its Q is 1. A2 falls between the two, with a Q of 0.666.
Both conditions must be checked. The acceptable-advantage threshold for three alternatives is 0.5. The Q gap between A1 and A2 is 0.666 and clears this threshold. A1 is also first in both S and R. Both conditions are satisfied, and the single compromise solution is A1. If the weights change places, that is, the heaviest criterion becomes the third, A2's Q rises to 0.668 and the result does not change.
In the report: "Among the three candidates, A1 has given the best result in both group utility and individual regret and is the single compromise solution. This result does not change under a weight swap."
Source: DecisionMind's validation example for the QR-VIKOR engine. The figures were calculated by independently rewriting the manifest's steps in Python and matched against the engine's own output.
2. Telecoms: Choosing a site for a new base station among three candidates
A telecom operator will choose among three candidate sites for a new base station. Three criteria have been set: contribution to coverage, installation cost, and risk of public objection. Installation cost is a "less is better" criterion. Each site's suitability has been turned into a pair from support and reservation scores given separately by the site-engineering team and the public-relations department.
| Site | Contribution to coverage | Installation cost | Public objection risk |
|---|---|---|---|
| S1 | 0.80 · 0.45 | 0.70 · 0.40 | 0.35 · 0.75 |
| S2 | 0.65 · 0.55 | 0.60 · 0.50 | 0.55 · 0.55 |
| S3 | 0.50 · 0.65 | 0.75 · 0.30 | 0.70 · 0.40 |
| Direction | more is better | less is better | more is better |
| Weight | 0.35 | 0.40 | 0.25 |
The method first swaps the support and rejection degree in the installation-cost column. The ideal and anti-ideal pairs are then chosen, every site's gap is measured, and S, R and Q are calculated.
| Site | S | R | Q | Rank |
|---|---|---|---|---|
| S1 | 0.153 | 0.153 | 0.000 | 1 |
| S3 | 0.600 | 0.350 | 0.752 | 2 |
| S2 | 0.786 | 0.400 | 1.000 | 3 |
The operator's hesitation is this. S1 is best both overall and on its worst criterion, and both conditions are satisfied. The acceptable-advantage threshold for three sites is 0.5. The Q gap between S1 and S3 is 0.752 and clears this threshold comfortably. If the weights change places, that is, installation cost becomes the lightest criterion, S3's Q falls to 0.750 and the ranking again does not change. The operator should still note that S1's rejection degree of 0.40 on the installation-cost criterion, that is, a partial reservation about the cost really being low, needs to be asked again at the contract stage.
In the report: "S1 is the single compromise solution on the coverage and cost criteria, and this result does not change under a weight swap. S1's 0.40 rejection share on its cost advantage must be separately verified before the contract."
3. What Not to Do
In the illustrative example, disregarding the rejection degree and running classical VIKOR on the support degrees alone gives A2 a Q of 0.500 instead of 0.666. The ranking does not change, but A2's real distance from the ideal is shown at the wrong magnitude. The second error is applying a source that says "rank from largest to smallest" as it stands and declaring A3 first. DecisionMind treats a smaller Q as better, and this reversal upsets the entire ranking. The third error is forgetting to swap the support and rejection degree on a criterion such as installation cost; in that case the most expensive site looks like the ideal option.
Sources
For the formulas behind each step, the intermediate tables and citation formats, see the DecisionMind method page: decisionmind.app/library/qr-vikor
Erdebilli, B., Gecer, E., Yılmaz, İ., Aksoy, T., Hacıoğlu, U., Dinçer, H., & Yüksel, S. (2023). Q-ROF Fuzzy TOPSIS and VIKOR Methods for the Selection of Sustainable Private Health Insurance Policies. Sustainability, 15(12), 9229. DOI: 10.3390/su15129229
Erdebilli, B., & Sıcakyüz, Ç. (2024). Q-ROF Fuzzy TOPSIS and Q-ROF Fuzzy VIKOR Method in the Evaluation of Sustainable Supply Chain Risk Management. Sustainability, 16(12), 4901. DOI: 10.3390/su16124901
Opricovic, S., & Tzeng, G.-H. (2004). Compromise solution by MCDM methods: A comparative analysis of VIKOR and TOPSIS. European Journal of Operational Research, 156(2), 445–455. DOI: 10.1016/S0377-2217(03)00020-1
Yager, R. R. (2017). Generalized orthopair fuzzy sets. IEEE Transactions on Fuzzy Systems, 25(5), 1222–1230. DOI: 10.1109/TFUZZ.2016.2604005
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