Classical back to the data type card207 methods
Classical
Methods that work with Classical data
Every method that works with this data type has a page of its own. Those with an academy card are explained here through their philosophy, how to read their output and worked cases; the rest open on their formula page in the library.
193 academy cards · 14 only in the library · 207 methods in the catalogue
Methods with an academy card
193 cards- RankingTOPSISTOPSIS ranks alternatives by how far they sit from two hypothetical points built out of the best and worst value on every criterion: the alternative closest to the ideal and furthest from the worst comes out on top.Open the card →
- RankingVIKORVIKOR ranks alternatives by weighing their total distance from the ideal together with their distance on the single worst criterion; it looks for a compromise solution that "everyone can accept."Open the card →
- RankingSAWSAW equalises the scale of every criterion, multiplies it by its weight, and sums directly; it is the oldest and plainest member of the multiple-criteria decision methods. The alternative with the highest weighted sum comes out first.Open the card →
- OutrankingPROMETHEE IIPROMETHEE II does not compare alternatives one by one against an ideal. Instead it compares them pairwise against each other, grading "how much better" on every criterion with a preference function. Summing these grades into a net flow yields a complete ranking.Open the card →
- OutrankingELECTRE IIt does not rank alternatives; for every pair, it asks together "am I superior on enough criteria" (concordance) and "am I not very poor on any criterion" (discordance), and extracts a "kernel" of alternatives that no other alternative outranks.Open the card →
- Subjective weightingAHPA subjective weighting method that sets criteria against one another through pairwise comparison, and from those comparisons derives both a weight vector and a consistency measure showing how far the underlying judgements conflict with one another.Open the card →
- Subjective weightingBWMA subjective weighting method that weights criteria through a non-linear model built from the comparisons an expert makes against only the most important and the least important criterion, and that asks for comparatively few judgements.Open the card →
- Subjective weightingSWARASWARA first orders the criteria by importance, then compares each criterion only with the one immediately above it; it is a subjective weighting method that produces a weight vector from the smallest possible number of judgements.Open the card →
- Objective weightingEntropy WeightingA method that derives criterion weights not from expert opinion but from the data itself: the more a criterion separates alternatives from one another, the more weight it receives.Open the card →
- Objective weightingCRITICA method that derives criterion weights from the data itself: a criterion earns more weight the more it separates the alternatives and the less it repeats what other criteria already say.Open the card →
- RankingEDASA method that ranks alternatives not by their position relative to the ideal, but by their position relative to the set's own average: an alternative that sits markedly above the average and falls only slightly below it comes out ahead.Open the card →
- RankingCOPRASA method that ranks alternatives by combining the ratio of the weighted sum of benefit criteria to the weighted sum of cost criteria, and gives a benefit degree expressed as a percentage of the best alternative.Open the card →
- RankingMARCOSA method that ranks alternatives by comparing each one to both an ideal (best possible) and an anti-ideal (worst possible) reference point, then combines these two ratios into a single utility function.Open the card →
- RankingCODASCODAS ranks alternatives by comparing them against a single worst reference point using two different distance measures. It looks first at straight-line, Euclidean, distance; if alternatives come out very close to one another, it also brings in horizontal-and-vertical, that is city-block, distance.Open the card →
- OutrankingPROMETHEEPROMETHEE is a family of outranking methods that compare alternatives not against a hypothetical ideal but against each other. It grades "how much better" on every criterion with a preference function, comparing alternatives pairwise, and combines these comparisons into positive and negative flows to yield a partial or a full ranking.Open the card →
- RankingTODIMTODIM carries into multi-criteria ranking a behavioural decision theory in which the decision-maker is assumed to be cautious about gains and disproportionately sensitive to losses. It weighs alternatives pairwise, treating "winning" and "losing" separately.Open the card →
- RankingWASPASWASPAS combines two different aggregation logics, the weighted sum and the weighted product, into a single result; it is a ranking method that offsets the weakness of one with the strength of the other.Open the card →
- RankingARASARAS measures each alternative by the ratio of benefit it delivers relative to a hypothetical "best" alternative derived from the same table, converting that ratio into a directly interpretable percentage degree of utility.Open the card →
- OutrankingELECTRENot a single method but a family of outranking methods. The family establishes the relation "which alternative clearly beats which" through concordance and discordance criteria. Members built on the same core logic produce a choice, a ranking or a sorting, depending on the purpose.Open the card →
- RankingMABACMABAC ranks alternatives not against an ideal or an average, but against their distance from a hypothetical "border area" built for every criterion. Sitting above the border strengthens an alternative; sitting below it weakens one.Open the card →
- RankingMOORAOne of the lightest ranking methods to compute, MOORA ranks alternatives by scaling each criterion value against that criterion's total magnitude, then subtracting the sum of the harmful ratios from the sum of the beneficial ratios.Open the card →
- RankingGRAGRA ranks alternatives by a "grey relational grade": how closely each one tracks a hypothetical "reference" alternative that holds the best performance on every criterion.Open the card →
- EfficiencyDEADEA is a benchmarking method that compares multiple units of the same kind by how well they convert inputs into outputs. It gives every unit an efficiency score between 0 and 1; it is not a preference-ranking method.Open the card →
- RankingCoCoSoA method that evaluates alternatives with both an additive and a multiplicative measure of performance, then ranks them by combining these two measures through three different compromise strategies.Open the card →
- RankingMULTIMOORAA method that ranks alternatives separately from three distinct viewpoints, ratio, distance from the worst case, and full multiplication, then combines those three rankings into a single order through dominance theory.Open the card →
- RankingWPMWPM raises each alternative's ratio on every criterion to a power equal to that criterion's weight, multiplies these together into a single unit-free score, and ranks alternatives on that score.Open the card →
- RankingELECTRE IIELECTRE II does not settle for ELECTRE I's core-set output. It runs the same outranking logic in two directions at once, from the best alternative downward and from the worst upward, and places every alternative in a full order. Where the two directions disagree, it prefers to say "incomparable" rather than force a verdict.Open the card →
- RankingSPOTISSPOTIS ranks alternatives by their distance to a fixed ideal point. That point is not built from the other alternatives in a given analysis but from "best possible / worst possible" bounds fixed before the analysis begins. The method thereby aims to prevent the ranking from shifting as the alternative set changes, that is, to prevent rank reversal.Open the card →
- RankingAROMANAROMAN does not rely on a single form of normalisation. It blends two different normalisations with a mixing coefficient, then combines the benefit and cost totals with a balance parameter to rank the alternatives.Open the card →
- RankingDNMADNMA does not rely on a single aggregation logic (sum alone, or product alone). It scores the same data by three different methods (weighted sum, weighted product, closeness to the ideal), then produces a single combined score by rewarding the consistency of both the scores and the ranks.Open the card →
- RankingMAUTMAUT first converts the value on each criterion into its own "utility" scale, then sums these utilities with weights. The result is a single figure for how much total utility an alternative delivers to the decision-maker.Open the card →
- RankingPSIPSI asks for no external criterion weights. It derives them itself from how much the alternatives differ on each criterion, then ranks the alternatives using those weights.Open the card →
- RankingRAFSIRAFSI maps alternatives onto a single scale interval against fixed ideal and anti-ideal points the decision-maker sets in advance, then ranks them. Because these points are fixed, the ranking does not break when an alternative is added or removed.Open the card →
- RankingRAWECRAWEC measures every alternative, on a weighted basis, both by "how close to the best" and "how far from the worst" it sits, then combines these two perspectives into a single comparison index.Open the card →
- RankingWISPWISP scores each alternative through four separate comparison logics, based on both summing and multiplying, and averages these four results into a single ranking.Open the card →
- RankingARTASIARTASI places every criterion column into an "adaptive" interval that widens according to the column's own scale, then scores alternatives jointly on both closeness to the ideal and distance from the anti-ideal.Open the card →
- Subjective weightingCIMASA subjective weighting method that converts the importance scores given by several experts into criterion weights, weighting each expert by their experience.Open the card →
- RankingCRADISA method that assesses alternatives through two separate utility ratios, one for how close they sit to the ideal point and one for how far they sit from the worst point, and ranks them by the average of these two ratios.Open the card →
- Subjective weightingDEMATELDEMATEL resolves the mutual influence between criteria from an influence matrix, separating how much influence each criterion gives from how much it receives, and so divides the criteria into a cause group and an effect group.Open the card →
- RankingELECTRE IIICompares pairs of alternatives on a fuzzy scale of "how credibly does one outrank the other" and distils these credibility degrees in two directions to derive an order; some pairs may remain incomparable.Open the card →
- RankingLMAWLMAW first standardises every cell in a way sensitive to both direction and magnitude, then passes it through a logarithmic transformation. It then sums these values through a weighted, bounded aggregation function to rank the alternatives. Its purpose is to stop extreme values from dragging the ranking to excess.Open the card →
- Objective weightingMERECMEREC derives criterion weights by looking at how much the alternatives' overall performance assessment would change if that criterion were removed from the table. The criterion that changes things most when removed receives the most weight.Open the card →
- RankingOCRAA method that separately sums the alternatives' relative shortfall on input (cost) criteria and their relative superiority on output (benefit) criteria, then combines the two at a common reference point to produce a ranking.Open the card →
- RankingROVROV ranks alternatives by the average of their best-case performance on benefit criteria and their worst-case performance on cost criteria.Open the card →
- RankingSMARTSMART places each criterion's worst and best end directly onto a 0-to-1 scale, then sums these using importance weights supplied by the decision-maker; it is a simple multi-attribute rating method.Open the card →
- RankingAPLOCOAPLOCO compares alternatives two at a time: it sums how far each alternative leads its rival on each criterion, subtracts how far it trails, and ranks alternatives by the net score that remains.Open the card →
- RankingCOBRACOBRA ranks alternatives by combining their distance to four separate reference points (best, worst, above-average and below-average), rather than looking at a single ideal point from four different angles.Open the card →
- RankingCOMETBefore any decision is made, COMET shows the expert not the real alternatives but every possible combination of criterion levels, the "characteristic objects"; once the expert has scored these fictional profiles, the real alternatives are placed onto this ready-made preference map.Open the card →
- RankingCompromise ProgrammingCompromise Programming ranks alternatives by how far they fall short of the best achievable value on each criterion; the alternative that falls short the least stands out as the best compromise.Open the card →
- RankingConsensus ReachingConsensus Reaching treats every criterion in a decision table as a separate judge and measures how consistently an alternative holds its position across those judges.Open the card →
- RankingCriteria RemovalCriteria Removal takes each criterion behind a ranking out of the table one at a time and checks how much the ranking shifts, revealing how dependent the ranking is on any single criterion.Open the card →
- RankingCross-ValidationCross-Validation removes each alternative behind a ranking from the table in turn and checks whether the relative order of the remaining alternatives holds, measuring how dependent the ranking is on the presence of any single alternative.Open the card →
- RankingERVDERVD judges every alternative not against an "ideal point" but against a reference (expectation) level the decision-maker has set in advance; it weighs losses below that reference more heavily than gains above it.Open the card →
- RankingEVAMIXWhen some criteria are measured numerically and others are expressed only as a ranking (first, second, third), EVAMIX combines the two types in a single analysis without converting one into the other.Open the card →
- RankingFDOSMFDOSM takes each alternative's performance on each criterion directly as an "opinion score," ratios this score against the best value, and combines it with weights to rank the alternatives.Open the card →
- RankingFMEAFMEA combines a product or process's possible failure modes into a single risk figure by multiplying scores for occurrence, severity and detectability; the failure with the highest figure is tackled first.Open the card →
- RankingFUCAFUCA compares alternatives not by their raw figures but by their rank on every criterion; the alternative with the smallest weighted sum of criterion ranks comes out on top.Open the card →
- RankingGoal ProgrammingGoal Programming first sets an attainable target level for every criterion, then compares alternatives by how far they fall short of that target; the alternative that approaches the targets with the least deviation comes out on top.Open the card →
- RankingHELLWIGThe Hellwig method ranks units, without using any externally supplied weight, by their distance from a statistical "development pattern" that it builds out of their own data.Open the card →
- RankingHFGPEHFGPE has every alternative judged not by one central authority but by all the other alternatives; it blends a generous and a strict viewpoint through a single adjustable parameter and ranks alternatives by their average peer score.Open the card →
- RankingIV-PROJECTIONIV-PROJECTION ranks alternatives by how large a "projection" each one casts in the direction of the ideal alternative; that projection carries both how closely the alternative resembles the ideal and how large it is in that same direction.Open the card →
- RankingKEMIRAKEMIRA splits the criteria into two meaningful groups, fits each group to the experts' priority rankings, and then ranks the alternatives by summing the two groups' scores.Open the card →
- RankingLINMAPRather than asking you for criterion weights, LINMAP asks for your pairwise preferences between alternatives; it then works out for itself the ideal point and the weights most consistent with those preferences, and ranks the alternatives by their distance to that ideal.Open the card →
- RankingLOCAL-OWALOCAL-OWA assesses alternatives within their own neighbourhoods rather than a single region; it works out which criterion is genuinely discriminating in each neighbourhood, and combines this with order weights that reflect the decision-maker's overall attitude to risk.Open the card →
- RankingLocal WLCLocal WLC accepts that the same criterion is not equally important in every region; it recalculates each neighbourhood's criterion weights against that neighbourhood's genuine range of variation, and scores the alternatives accordingly.Open the card →
- RankingLoPMLoPM assigns each property its own limit, a floor, a ceiling or a target value, and scores alternatives by how well they meet that limit before summing the scores by weight.Open the card →
- RankingMACONTRather than relying on a single form of scale equalisation, MACONT blends three different normalisations, scores every alternative in two separate ways, one comparing it against an average rival and one looking at its best-worst extremes, then combines these two scores.Open the card →
- RankingMAIRCAMAIRCA measures the gap between what each alternative "theoretically deserves" as a share and what it "actually delivers" in performance, and puts forward the alternative with the smallest gap.Open the card →
- RankingMARAMARA compares every alternative with a hypothetical "ideal alternative" and measures the gap as the area beneath a line segment; the smaller this area, the further ahead the alternative stands.Open the card →
- RankingMonte Carlo SimulationRather than producing a single order from a single set of weights, Monte Carlo simulation tries thousands of possible weight sets and counts how often each alternative comes first, second and so on, to show how robust the ranking is.Open the card →
- RankingMOOSRAMOOSRA divides each alternative's total weighted strength on the benefit criteria by its total weighted burden on the cost criteria, and brings forward the alternative with the largest such ratio.Open the card →
- RankingNAIADENAIADE converts the gap between two alternatives, when compared, into fuzzy degrees such as "much better," "slightly better" and "no difference"; without asking for weights, it combines these comparisons across every pair to produce an order.Open the card →
- RankingORESTEORESTE is a method that compares alternatives and the importance of criteria not by exact figures but purely by their ranks, producing a single order.Open the card →
- RankingOWAOWA is an aggregation method that weights criterion values not by which criterion they came from but by the rank they occupy within each alternative, letting the decision-maker's optimistic or cautious attitude show up directly in the result.Open the card →
- RankingPAMPAM turns every alternative into a polygon with as many sides as there are criteria, and ranks alternatives by the area that polygon covers.Open the card →
- RankingPIVPIV ranks alternatives solely by their distance from the best value attainable on each criterion; unlike TOPSIS, it does not take the worst point as a reference.Open the card →
- RankingPROBIDPROBID is a ranking method that judges alternatives not by distance to a single ideal point, but by distance to a whole series of hypothetical "rank" points running from best to worst, and to their average.Open the card →
- RankingPROSA-CPROSA-C corrects the balanced score PROMETHEE II produces with a penalty that measures whether an alternative built that score from a single criterion or evenly across all of them; an alternative that shines on one criterion while staying weak on the rest is pulled back.Open the card →
- RankingProximity-Adjusted WLCProximity-Adjusted WLC does not hold each alternative's criterion weights fixed; instead it redistributes them according to the alternative's geographic location, so that alternatives close to a reference point see the criteria under one set of relative importance, and distant alternatives under another.Open the card →
- RankingQUALIFLEXQUALIFLEX tries every possible ordering of the alternatives in turn and, by summing how well each criterion agrees with that ordering, selects the ordering with the highest total agreement.Open the card →
- RankingRAMRAM accumulates each alternative's total contribution on benefit and cost criteria separately, then collapses them into a single number by placing cost in a power exponent and benefit in a base value: a high cost shrinks the exponent, a high benefit grows the base.Open the card →
- RankingRank Reversal AnalysisRank Reversal Analysis does not compute a ranking method's result once and stop there; it reruns the same method after adding a new candidate to the alternative set or removing one, and counts whether the remaining alternatives' order relative to one another breaks.Open the card →
- RankingRAPSRAPS compares two alternatives directly, measures the size of the gap between them, and ranks every alternative by this "how much better" strength against all its rivals.Open the card →
- RankingREGIMEREGIME compares two alternatives not by the magnitude of their numbers but purely by who is better and who is worse on each criterion, then sums this simple superiority information with the criterion weights to build a ranking.Open the card →
- RankingRIMRather than assuming "more is always better," RIM defines a target range for every criterion and ranks alternatives by how close they sit to that target range.Open the card →
- RankingSAPEVO-MSAPEVO-M aggregates the simple "which is better" judgements that several decision-makers give, for both criteria and alternatives, into a single common ranking.Open the card →
- RankingSECASECA does not take criterion weights from outside; while ranking the alternatives, it derives the weights too, from the same calculation, out of its own data.Open the card →
- RankingSensitivity AnalysisSensitivity analysis does not rank alternatives itself; it measures how robust a ranking remains once criterion weights are perturbed a little.Open the card →
- RankingSIMUSSIMUS turns each criterion in turn into an "objective" and solves a linear programming problem; the shares it hands to the alternatives fall out of these repeated solutions.Open the card →
- RankingSOWASOWA applies a different risk attitude, depending on the geographic zone alternatives sit in, when ranking them by criterion scores; the same table is assessed optimistically or pessimistically according to its zone.Open the card →
- RankingSPROBIDSPROBID is a lighter-weight form of PROBID; it ranks alternatives not against every reference point in between, but only against the references in the best and worst quartile.Open the card →
- RankingSTOCHASTIC-UTASTOCHASTIC-UTA derives a consistent utility function from a reference ranking supplied by the decision-maker, and carries uncertainty in the criterion values through into the result by sampling.Open the card →
- RankingTAXONOMYTAXONOMY standardises alternatives on each criterion against their own mean and standard deviation, then converts their distance to a hypothetical "best" reference point into a single measure of development.Open the card →
- RankingUTAUTA observes how the decision-maker ranks a handful of reference alternatives and derives, by linear programming, an additive utility function consistent with that ranking.Open the card →
- RankingUTASTARUTASTAR takes a ranking the decision-maker has already given for a small group of alternatives, derives a utility function that reproduces that ranking with the least error, and applies that function to the whole list to rank every alternative.Open the card →
- RankingWEBIRAWEBIRA computes two separate ratios for every alternative, how close it is to the ideal and how far it is from the worst case; it ranks alternatives by the weighted sum of the difference between these two ratios.Open the card →
- RankingWEDBAWEDBA ranks alternatives by their weighted Euclidean distance to two hypothetical points built from the best and worst value on every criterion; the alternative far from the worst and close to the best comes out on top.Open the card →
- RankingWeight Sensitivity AnalysisWeight sensitivity analysis is a robustness test that computes how much the criterion weights behind a ranking can change, and at what point that change breaks the ranking.Open the card →
- RankingWeighted VotingWeighted voting turns the rankings given by several decision-makers or sources into a single shared ranking, using Borda scores weighted by each source's reliability.Open the card →
- RankingWINGSWINGS measures, within a system built from components that influence one another, how central each component is and whether it stands mainly as an influencer or as something influenced.Open the card →
- RankingWSMWSM calculates each alternative's score by multiplying its criterion values by their weights and summing them; it is the oldest and simplest of the multi-criteria decision methods.Open the card →
- OutrankingEXPROM IEXPROM I evaluates the difference between two alternatives on two levels, "somewhat better" and "much better, almost beyond dispute", and leaves pairs that cannot be clearly compared unranked rather than forcing them into an order.Open the card →
- OutrankingEXPROM IIEXPROM II evaluates the difference between two alternatives on two levels, "somewhat better" and "much better, almost beyond dispute". Unlike EXPROM I, it reduces every alternative to a single net-flow score and gives a complete ranking.Open the card →
- OutrankingPAMSSEM IPAMSSEM I compares alternatives pairwise and measures how far one outranks the other in each pair; in some pairs this comparison yields no clear result, and the two alternatives remain incomparable.Open the card →
- OutrankingPAMSSEM IIPAMSSEM II uses the same concordance and flow calculation as PAMSSEM I, but at the end places every alternative in order by its net flow; it leaves no incomparable pair, always producing a complete ranking.Open the card →
- OutrankingSIRSIR calculates separately how much each alternative outperforms the others and how much it falls behind them, then combines these two values into a single net score to rank the alternatives.Open the card →
- Structural analysisISMISM is a structural analysis method that collects the "which factor affects which" relationship among a group of factors from a panel of experts and separates them into levels, drawing a hierarchy from root cause to outcome.Open the card →
- Subjective weightingANPANP models the relationship between criteria and alternatives not as a one-way hierarchy but as a network of mutual interactions, and produces weights from the point where that network settles into equilibrium.Open the card →
- Subjective weightingDANPDANP first measures the mutual influence between criteria with DEMATEL, then carries this influence into ANP's network structure to weight criteria by their power to influence one another.Open the card →
- Subjective weightingThe Delphi MethodDelphi collects opinion from experts round by round, without them knowing one another's identity, and shows each round a summary of the previous one to track whether the views are converging on a consensus.Open the card →
- Subjective weightingDIBRDIBR asks the expert to rank criteria by importance and to state only the share between each pair of consecutive criteria; it then derives the weights from these consecutive shares in a chain.Open the card →
- Subjective weightingFUCOMFUCOM asks the expert to rank the criteria by importance and to state only the importance ratio between successive criteria; it then finds the weights through a calculation that matches these ratios as consistently as possible.Open the card →
- Subjective weightingFuzzy DelphiFuzzy Delphi asks experts not for a single number but for a triangular range in the form "at least, most likely, at most"; it pools the opinion across experts by combining these triangles and reduces them to a single central value that becomes a weight.Open the card →
- Subjective weightingLBWALBWA asks the expert first to select the most important criterion, then to split the remaining criteria into a few levels of importance and give each a small influence score within its level; no pairwise comparison is made between criteria.Open the card →
- Subjective weightingMACBETHMACBETH never asks an expert for a number; it only asks which of the categories "no difference, very weak, weak, moderate, strong, very strong, extreme" the attractiveness gap between two alternatives falls into, and turns these verbal judgements into a consistent numerical scale.Open the card →
- Subjective weightingPIPRECIAPIPRECIA takes criteria in any order and asks, for each one, a single question: is it more important than the previous criterion, equally important, or less important; unlike SWARA, it does not require the criteria to be pre-ranked by importance.Open the card →
- Subjective weightingREVISED-SIMOSA subjective weighting method that has an expert arrange cards representing criteria from least to most important, measures the size of an importance gap through blank cards placed between them, and fixes the scale with a single extreme ratio.Open the card →
- Subjective weightingROCA subjective weighting method that assigns weights to criteria from ranking information alone, asking for no numerical comparison at all, and computes them with a closed formula.Open the card →
- Subjective weightingSIWECA subjective weighting method that takes direct scores from several experts and derives criterion weights from how consistently discriminating each expert's own scoring is.Open the card →
- Subjective weightingSWINGA subjective weighting method that asks the expert to score, directly out of 100, the benefit of "swinging" each criterion from its worst to its best value, then normalises those scores to produce weights.Open the card →
- Objective weightingCCSDAn objective weighting method that derives criterion weights from both each criterion's own spread and that criterion's relationship with the overall evaluation, by solving a system of non-linear equations.Open the card →
- Objective weightingCILOSCILOS derives criterion weights from the data itself by measuring how much choosing the best alternative on one criterion costs you on every other criterion.Open the card →
- Objective weightingFAREFARE starts from a relationship table showing how strongly and in which direction each criterion affects the others, and gives the highest weight to the criterion that influences the rest the most.Open the card →
- Objective weightingGini Coefficient WeightingAn objective weighting method that derives a criterion's weight from how unequally the alternatives' shares are distributed on that criterion: where the share is concentrated in a few alternatives the criterion receives a high weight, where the share is spread equally across everyone it receives a low weight.Open the card →
- Objective weightingIDOCRIWAn objective weighting method that derives criterion weights by using two different objective measures together: how well the data discriminates between alternatives, and the loss that would follow from disregarding a criterion.Open the card →
- Objective weightingLODECIRather than asking an expert for criterion weights, LODECI derives them from the sharpest difference found between alternatives: however far apart at least one pair of alternatives sits on a criterion, that criterion gains a correspondingly greater say in the decision.Open the card →
- Objective weightingLOPCOWLOPCOW derives criterion weight from the spread within the data itself: the more a criterion makes alternatives "lose out" relative to the best, the more weight that criterion gains.Open the card →
- Objective weightingMPSIMPSI takes an intermediate value that the Preference Selection Index method uses silently, inside itself, to rank alternatives, and presents it directly as a visible criterion weight.Open the card →
- Objective weightingNMDNMD derives criterion weight from the data's own mean: the further, on average, the alternatives sit from the best value on a criterion, the more weight that criterion gains.Open the card →
- Objective weightingPCA WeightingPCA Weighting derives criterion weight from the shared movement between criteria: the more a criterion draws on the few "principal axes" that actually separate the alternatives, the more weight it earns.Open the card →
- Objective weightingSD-WEIGHTThe plainest objective weighting method there is: it derives a criterion's weight not by asking an expert but from how much the alternatives differ from one another on that criterion.Open the card →
- Objective weightingSPCAn objective method that treats the exact midpoint between a criterion's smallest and largest value as its "symmetry point" and derives criterion weights from how far the alternatives spread away from that point.Open the card →
- Objective weightingWENSLOAn objective method that treats each criterion's cumulative values as a zigzag line and derives criterion weight from the ratio of that line's length to its average slope.Open the card →
- SensitivityBootstrap ResamplingIt redraws your set of alternatives, with replacement, many times over, rebuilds the ranking from scratch on every draw, and shows how much an alternative's rank depends on that randomness.Open the card →
- SensitivityKendall's TauA coefficient that compares two rankings pair by pair, reduces the difference between concordant and discordant pairs to a single figure, and measures how closely two rankings coincide.Open the card →
- SensitivityKendall's WA method that reduces how closely the rankings given by three or more rankers (experts, methods, criteria) resemble one another to a single concordance coefficient between zero and one.Open the card →
- SensitivityWeight Sensitivity AnalysisA method that measures whether small changes in criterion weights overturn a ranking's winner; it does not produce a ranking itself, it says how robust an already-produced ranking is.Open the card →
- SensitivityMorris Elementary Effects ScreeningA screening method that sifts through a large number of factors influencing a decision result to sort out which ones genuinely matter and whether each affects the result in a plain or a tangled way, using only a small number of trials.Open the card →
- SensitivitySobol Variance-Based Sensitivity AnalysisA sensitivity method that divides how much of the variability in a decision result comes from which factor into shares that add up to a hundred per cent, separating out whether the factors act alone or together.Open the card →
- SensitivitySpearman Rank CorrelationA method that measures how alike two separate rankings are with a single number: plus one means perfect agreement, minus one means perfect disagreement, and zero means no relationship at all.Open the card →
- ConsistencyGeometric Consistency IndexA consistency indicator that measures, through the geometric mean, how consistent a pairwise comparison matrix is (for instance, the importance judgements between criteria in AHP) in a single number.Open the card →
- ConsistencyHarmonic Consistency IndexA consistency indicator that calculates a pairwise comparison matrix's consistency along lines similar to Saaty's classical eigenvalue method, but through the harmonic mean, giving a more cautious result.Open the card →
- ConsistencyKoczkodaj Inconsistency IndexThe Koczkodaj inconsistency index finds the most contradictory triad in a pairwise comparison table and reports the size of that contradiction as a single number.Open the card →
- Aggregation and votingAverage RankingAverage ranking takes several existing rank lists for the same alternatives and produces a single combined ranking by averaging each alternative's rank numbers.Open the card →
- Aggregation and votingBorda CountThe Borda count awards every alternative a score based on its position in a set of rank lists, then ranks the alternatives by the sum of these scores.Open the card →
- Aggregation and votingDominance TheoryDominance theory counts the cases where an alternative is never strictly behind another across all rank lists and is ahead in at least one; where no strict superiority exists, it draws no distinction between alternatives.Open the card →
- Aggregation and votingChoquet IntegralThe Choquet integral combines criteria not with fixed weights but with an "importance measure" assigned to groups of criteria, so that synergy and redundancy relationships between criteria are taken into account.Open the card →
- Aggregation and votingCondorcetCondorcet compares alternatives two at a time and declares the winner to be whichever alternative beats every other alternative in a pairwise comparison; if no such alternative exists, the method says so plainly.Open the card →
- Aggregation and votingCOOK-SEIFORDCOOK-SEIFORD finds the single assignment that minimises the total gap between each alternative's positions across different ranking sources and a possible target rank.Open the card →
- Aggregation and votingCOPELANDCOPELAND compares every alternative against all its rivals in pairs and builds a complete rank from the net score obtained by subtracting the number of losses from the number of wins.Open the card →
- Aggregation and votingDODGSONDODGSON calculates how many adjacent swaps each alternative needs in the rankings to become the majority winner, and declares the alternative requiring the fewest changes the winner.Open the card →
- Aggregation and votingKEMENY-YOUNGKEMENY-YOUNG selects, from among all possible complete rankings, the single ranking that falls into the least total disagreement with every ranking source combined.Open the card →
- Aggregation and votingMedian RankingMedian ranking collapses several separate rankings produced for the same alternative set into a single order, by looking at each alternative's median position across those rankings.Open the card →
- Aggregation and votingNANSONNanson's method eliminates, in every round, whichever alternatives fall below the mean score and rescores those that remain; it repeats these elimination rounds until a single alternative is left.Open the card →
- Aggregation and votingRATRAT selects one of the alternatives as a reference and combines, into a single number, how far every other alternative sits ahead of or behind that reference across the rankings produced by different methods.Open the card →
- Aggregation and votingSCHULZEThe Schulze method compares alternatives pairwise and finds the strongest indirect path of superiority between every pair, producing a single order that is consistent with those pairwise comparisons.Open the card →
- Aggregation and votingWAMWAM multiplies each criterion's score by its own weight and sums the products, reducing the alternatives to a single figure; it strikes a perfectly linear balance among criteria, favouring none over another.Open the card →
- Aggregation and votingBonferroni MeanThe Bonferroni mean pairs up criteria two at a time and averages the product of each pair, so that a weakness on one criterion overlapping with a weakness on another is penalised more heavily than a weakness standing alone.Open the card →
- Aggregation and votingHeronian MeanThe Heronian mean pairs criteria off two by two, including a criterion with itself, and averages the product of each pair; it follows a logic close to the Bonferroni mean, but also brings each criterion's own square into the calculation, which makes it slightly more tolerant of extremes than the Bonferroni mean.Open the card →
- Aggregation and votingPower MeanThe power mean generates an entire family of averages, from the harmonic mean through the geometric and arithmetic means and beyond, from a single formula by varying one power parameter; the result grows as the parameter grows.Open the card →
- Aggregation and votingWGMWGM raises each criterion score to the power of its own weight and multiplies the results; an alternative that scores very low on a single criterion is punished severely, whatever its performance elsewhere.Open the card →
- Aggregation and votingWHMWHM takes the reciprocal of each criterion score, averages those reciprocals with weights, then takes the reciprocal of that average; it is the most punishing aggregation form in the family, weighing a low score far more heavily than the others.Open the card →
- NormalisationLinear Max NormalizationThis method scales every criterion column by dividing it by its own best value; for a benefit criterion the column's reference point is its largest value, and for a cost criterion its smallest value, so that the best alternative on that criterion always receives exactly 1 point.Open the card →
- NormalisationLinear Sum NormalizationThis method rescales every criterion column by dividing it by its own total: each alternative receives a share showing how much of that column's combined performance falls to it, and every column sums to exactly 1.Open the card →
- NormalisationLogarithmic NormalizationThis method rescales every column by dividing each cell's natural logarithm by the sum of the logarithms in that column; this preserves the proportional difference between large values while reducing the dominance of the absolute magnitude gap.Open the card →
- NormalisationMin-Max NormalisationThis method places every criterion column between 0 and 1 according to the range between the worst and best value in that column; the column's best value always scores 1, its worst always scores 0.Open the card →
- NormalisationVector NormalisationVector normalisation is a preparatory step that divides every column of a decision table by its own Euclidean length, making all criteria unit-free and comparable.Open the card →
- NormalisationVector (L2) NormalisationVector (L2) normalisation is DecisionMind's second record of the same classical preparation step that divides every column of a decision table by its own Euclidean length, making criteria unit-free and comparable.Open the card →
- NormalisationZ-Score NormalisationZ-score normalisation is a preparatory step that scales every column of a decision table against its own mean and standard deviation, converting each measure into a unit-free number expressing "how many standard deviations from the mean."Open the card →
- DistanceChebyshev DistanceChebyshev distance is a distance measure that gauges the distance between two alternatives not by the sum of all criteria but solely by the single largest criterion difference.Open the card →
- DistanceEuclidean DistanceEuclidean distance reduces the overall difference between two alternatives to a single straight-line length, by squaring the difference on each criterion, summing the squares and taking the square root.Open the card →
- DistanceHAMMING DISTANCEHamming distance compares two equal-length sequences and counts only how many positions differ outright; it takes no interest in the size of the difference.Open the card →
- DistanceMANHATTAN DISTANCEManhattan distance measures the difference between two alternatives by summing the absolute deviation on each criterion one by one; a large deviation on one criterion does not overshadow the others.Open the card →
- DistanceMINKOWSKI DISTANCEMinkowski distance is a general distance family tuned by a single number p; as p grows, the weight of the single worst criterion increases, and as it shrinks, the deviation is shared equally across criteria.Open the card →
- DistanceMAHALANOBIS DISTANCEMahalanobis distance measures how far apart two points are while taking the relationship (correlation) between criteria into account; the same raw gap can come out small or large depending on whether it fits the criteria's usual pattern of moving together.Open the card →
- BWM extensionsBayesian BWMBayesian BWM is the form of BWM that combines the best-to-others and others-to-worst comparisons given by multiple decision-makers into a single hierarchical probability model and converts them into weights. The output is still a weight vector, but each weight now comes with a confidence interval and a probability table showing how certain the superiority between criteria actually is.Open the card →
- PROMETHEE extensionsPROMETHEE IThis is the form within the PROMETHEE family that keeps the incoming and outgoing flows separate rather than merging them into a single net flow, and honestly leaves some pairs of alternatives "incomparable." Its output is not a complete ranking but a partial dominance relation.Open the card →
- PROMETHEE extensionsPROMETHEE IIIThis is the form within the PROMETHEE family that presents every alternative's net flow not as a single number but as a confidence interval. Two alternatives are ranked strictly only if their intervals do not overlap; if the intervals overlap, the two are treated as indifferent.Open the card →
- PROMETHEE extensionsPROMETHEE VThis is the form of PROMETHEE that selects rather than ranks. Under a resource constraint, it finds the subset of alternatives that maximises the total net flow. The output is not a ranking; it is a selected-or-rejected decision for every alternative.Open the card →
- PROMETHEE extensionsPROMETHEE VIThis is the form of PROMETHEE that turns the ranking into an interval for situations where the weights are not known exactly. Every alternative's net flow is not a single number but the lowest and highest value it can take while the weights vary within a plausible band.Open the card →
- ELECTRE extensionsELECTRE IVThis is the member of the ELECTRE family that assigns no weight to criteria at all. It works with three thresholds per criterion (indifference, preference, veto), and its output is not a complete ranking but a partial pre-order that emerges from a two-way distillation.Open the card →
- GRA extensionsInterval Number Grey Relational AnalysisThis is the form of GRA for situations where criterion values are given not as a single number but as a known, exact lower and upper bound. It carries the bounds through without reducing them to a single number at any step; it computes the reference and the distance from the two bounds together.Open the card →
- DEA extensionsData envelopment analysis BCC (variable returns to scale)This is the form of DEA for situations where the units being compared differ in size and that size difference must not distort the efficiency comparison. The output remains an efficiency score, together with every unit's returns-to-scale classification (advantaged at small scale, or at large scale).Open the card →
- DEA extensionsDEA cross-efficiencyThis is the form of DEA where every unit is evaluated not only by its own chosen weights but also by every other unit's chosen weights, with units scoring one another reciprocally. The output is a single cross-efficiency average for every unit, and this average places the units in a complete ranking.Open the card →
- DEA extensionsDynamic Network DEAThis is the form of DEA that compares units across several consecutive periods rather than within a single year. It also accounts for an asset carried over between periods and an undesirable output that spills from one period into the next. Its output is a single combined efficiency score for each unit.Open the card →
- DEA extensionsEnvironmental DEAThis is the form of DEA for situations where an undesirable output (such as a pollutant) cannot be disposed of freely, but can only be reduced proportionally alongside the inputs. Its output is again an environmental efficiency score between 0 and 1.Open the card →
- DEA extensionsTwo-Stage Network DEAThis is the form of DEA for situations where a unit converts input into output not in one step, but across two consecutive stages through an intermediate product. It can also produce an undesirable output in the second stage. Its output is again a network efficiency score between 0 and 1.Open the card →
- DEA extensionsNetwork SBM DEAThis is the form of DEA that evaluates a multi-stage process with its own importance weight per stage. It measures input/output slack directly rather than proportionally, and can examine several periods together within a single window. Its output is again a network efficiency score between 0 and 1.Open the card →
- DEA extensionsDEA Range-Adjusted Measure of Inefficiency (RAM)RAM is a form of DEA that measures and sums, separately for each measure against its own value range, the input excess and output shortfall that a classical radial (percentage) score can overlook. The output is again an inefficiency score between 0 and 1, but this score captures not only the proportional contraction but also any remaining slack.Open the card →
- DEA extensionsSlacks-Based Measure DEA (SBM)SBM is a form of DEA that, instead of a classical proportional contraction ratio, directly measures every input excess and output shortfall on its own scale. The result is again an efficiency score between 0 and 1, but this score rests not on a ratio but directly on the slack share.Open the card →
- DEA extensionsSuper-Efficiency DEASuper-efficiency DEA is a form that allows units classical DEA rates as equally "efficient" (theta=1) to be ranked amongst themselves as well. Each unit is re-evaluated with its own data excluded from the reference set; this brings out a degree of superiority even among efficient units.Open the card →
- SPOTIS extensionsBalanced SPOTISBalanced SPOTIS is the form of SPOTIS that, alongside the fixed ideal, also takes into account a "realistic target" point set by the decision-maker. It blends the distance to the two reference points with a single coefficient, and still ranks alternatives by one distance value.Open the card →
- SMART extensionsSMART weightingSMART weighting runs, on its own, the step of SMART that converts importance ratings into weights. Its input is not an alternative table but only the importance ratings given to criteria; its output is a weight vector that sums to 1.Open the card →
Other methods in the library
These methods do not yet have an academy card. Their formulae, steps and source citation live in the library; each link opens the method page directly.
- IV-ARAS - Interval extension of ARAS1966 ↗
- IV-COPRAS - Interval extension of COPRAS1966 ↗
- IV-EDAS - Interval extension of EDAS1966 ↗
- IV-MARCOS - Interval extension of MARCOS1966 ↗
- IV-MOORA - Interval extension of MOORA1966 ↗
- IV-SAW - Interval extension of SAW1966 ↗
- IV-TODIM - Interval extension of TODIM2020 ↗
- IV-TOPSIS - Interval extension of TOPSIS2006 ↗
- IV-VIKOR - Interval extension of VIKOR1966 ↗
- IV-WASPAS - Interval extension of WASPAS1966 ↗
- N-COCOSO - Neutrosophic CoCoSo2024 ↗
- N-WISP - Neutrosophic WISP2022 ↗
- Prob-ARAS - Stochastic extension of PROB-ARAS2010 ↗
- VIKOR-SMAA - VIKOR with Stochastic Multicriteria Acceptability Analysis2009 ↗