Methods · Ranking
UTA (Additive Utility Method)
UTA observes how the decision-maker ranks a handful of reference alternatives and derives, by linear programming, an additive utility function consistent with that ranking.
Base method's data type: Classical
What Is the Method?
UTA answers the question: "instead of asking the decision-maker directly for weights or a utility formula, how can I extract that information from the way they rank a handful of reference alternatives?" Its output is a marginal utility curve for every criterion, a total utility score for every alternative, and the rank that score produces. It was proposed by Jacquet-Lagrèze and Siskos in 1982 and is the founding method of the preference disaggregation approach. It is used in fields such as consumer preference modelling, supplier selection and product evaluation, where the decision-maker is more comfortable ranking concrete examples than assigning abstract weights. It has many extensions, including UTASTAR, UTADIS and STOCHASTIC-UTA.
The Philosophy Behind It
Most multi-criteria decision methods, such as AHP and SWARA, ask the decision-maker directly for weights or pairwise comparisons. UTA's philosophy reverses this. Many people find it difficult to assign abstract weights, but are more comfortable ranking concrete examples; saying "I prefer this car to that one" is easier than saying "I give speed a weight of thirty per cent." UTA asks the decision-maker to rank a handful of reference alternatives, then searches mathematically for a utility function consistent with that ranking; this is called preference disaggregation.
An analogy makes this clear. A wine taster may not be able to explain in a formula why they like a wine, but can confidently rank several wines. UTA works backwards from the taster's ranking to infer how much value they place on which characteristics (acidity, tannin, alcohol content). The philosophical consequence is this: UTA is additive and compensatory, and assumes independence between criteria. It also measures the decision-maker's own consistency directly, through an error term; if this error term is zero, the decision-maker is fully consistent, and if it is greater than zero, there is an internal contradiction, which the method does not hide but expresses as a number.
How It Works
The method proceeds through four steps.
First, defining the breakpoints. For every criterion, a range is set from worst to best and divided into a fixed number of equal breakpoints. These breakpoints are the points at which the criterion's utility curve will be defined piecewise-linearly.
Second, evaluating the reference alternatives. Each ranked reference alternative's value on every criterion is expressed linearly between the two nearest breakpoints. The alternative's total utility is written as the sum of the criterion utilities plus a small error term.
Third, building and solving the linear programming model. A model is built to minimise the total error term; the model carries three types of constraint. Preference constraints require the utility gap between every consecutive pair in the reference ranking to exceed a set minimum threshold; for pairs ranked as equally preferred, this gap must be zero. Monotonicity constraints ensure that, for a criterion, the next breakpoint never gives lower utility than the previous one. Normalisation constraints fix the worst breakpoint's utility at zero and the sum of all criteria's best-breakpoint utilities at one. The model is solved and the smallest total error term (F*) is found.
Fourth, robustness analysis. The linear programming solution may not be unique; more than one utility function can produce the same minimum error term. A broad solution region is therefore defined, allowing an error term close to F*. Within this region, the smallest and largest utility values that each criterion's best breakpoint can take are separately computed; averaging these solutions gives a representative utility function that does not depend on a single arbitrary solution.
The formulas behind each step, the intermediate tables and the citation formats are given on the DecisionMind method page; this card carries no formulas.
How to Read the Output
The total utility score shows how good an alternative is according to the decision-maker's inferred preference logic; the best alternative generally receives a value close to 1. But more important than this score is the error term (F*). If F* is zero, the decision-maker's reference ranking is fully consistent with an additive utility function. If F* is greater than zero, the decision-maker's preferences do not fit an additive model exactly; this is not a calculation error, but UTA revealing the decision-maker's own inconsistency. Because the solution may also not be unique, presenting a single LP solution as the definite truth without a robustness analysis is misleading.
Thus instead of writing:
"UTA found the decision-maker's true preference with certainty"
the report should read:
"This utility function is the most consistent model possible with the reference ranking the decision-maker gave; if the error term is zero the ranking is fully consistent, and if it is greater than zero this inconsistency must be shown in the report"
Data Type and Inputs
UTA works with crisp data: one number per cell. DecisionMind holds UTA only in this base form; there is no separate data-type extension.
You need: alternatives in rows, criteria in columns, one number per cell; the worst and best extreme value for every criterion. You also need a reference ranking in which the decision-maker has ranked all, or a representative subset, of the reference alternatives. UTA does not require weights; it produces a utility function itself (and, implicitly, a weight distribution). The recommended number of reference alternatives is between five and thirty, and a comfortable range for the number of criteria is three to twelve.
When to Use It, When Not To
UTA is a sound choice if the decision-maker can confidently rank concrete examples but struggles to assign abstract weights. If the decision-maker has no reference alternatives to rank, or has no clear preference among them, the method lacks the data it needs to run; in that case, methods that ask directly for weights (AHP, BWM, SWARA) should be used instead. If the reference ranking is seriously inconsistent (the error term is very large), UTA's single-error-variable structure may prove inadequate.
The decision-maker can rank examples but cannot assign abstract weights → UTA
No reference ranking exists, or it is unreliable → AHP, BWM, SWARA (methods that ask directly for weights)
The reference ranking is seriously inconsistent, the error term is large → UTASTAR (a separate error variable for every pair)
Not a ranking but only weights are needed → Entropy, CRITIC (objective) or AHP, BWM, SWARA (subjective)
Strengths
UTA's core strength is that it asks the decision-maker for an intuitive task, ranking examples, rather than abstract weights; in practice this yields more reliable information. The error term (F*) measures the decision-maker's own consistency directly and transparently. The robustness analysis avoids dependence on a single arbitrary solution, and how well the resulting ranking matches the reference ranking can be shown concretely with Kendall's tau coefficient; in the founding paper's own example, this coefficient comes out at 1.0.
Weaknesses
Its limitations stem from the structure of the model. First, the linear programming solution may not be unique; without a robustness analysis, an arbitrary solution can be mistaken for the true one (Siskos, Grigoroudis and Matsatsinis, 2005). Second, the piecewise-linear utility assumption can remain a crude approximation if the true preference curve is strongly non-linear (threshold-driven, S-shaped); increasing the number of breakpoints partly addresses this but increases the computational load. Third, the result depends directly on the size and quality of the reference set; a small or carelessly chosen reference set can produce an unreliable utility function. Fourth, it has been shown that preference disaggregation methods need additional assumptions when working with uncertain or incomplete preference information (Wu and Liao, 2023).
Common Mistakes
The most common mistake is entering the reference ranking as a dictionary in the form {alternative: rank} and then processing it by the order in which items were entered into the dictionary, rather than by the rank value; this unknowingly builds the wrong model. A second mistake is reversing the direction of a cost criterion by rearranging the criterion range itself (swapping the worst and best ends) and then reversing it a second time separately; this double reversal breaks the direction again. A third mistake is presenting the result as definite fact when the error term (F*) is greater than zero; in that case, the inconsistency should be stated in the report, or a more flexible model such as UTASTAR should be used instead. A fourth mistake is presenting a single LP solution as an immutable utility function without a robustness analysis.
The governing principle is this:
A UTA result is the most consistent additive model possible with the reference ranking the decision-maker gave; ignoring the error term and the uniqueness of the solution creates a false impression of certainty.
Cases
Each case opens with a decision table, describes in words what the method does to it, and shows how to read the result. The first case is drawn from the method's founding source, and its figures are the paper's own; the remaining cases are illustrative constructions.
1. Consumer Preference: A Preference Ranking among Ten Cars (Jacquet-Lagrèze and Siskos, 1982)
In a car evaluation, ten vehicles are compared against six criteria: maximum speed, fuel consumption, acceleration time, interior space/comfort score, road-holding score and price. Fuel consumption, acceleration time and price are "lower is better," the other three are "higher is better." The decision-maker ranked the ten cars by their own subjective preference from A1 to A10 (A1 most preferred, A10 least).
| Car | Speed | Fuel consumption | Acceleration | Interior space | Road-holding | Price |
|---|---|---|---|---|---|---|
| A1 | 173 | 11.4 | 10.01 | 10 | 7.88 | 49,500 |
| A2 | 176 | 12.3 | 10.48 | 11 | 7.96 | 46,700 |
| A3 | 142 | 8.2 | 7.30 | 5 | 5.65 | 32,100 |
| A4 | 148 | 10.5 | 9.61 | 7 | 6.15 | 39,150 |
| A5 | 178 | 14.5 | 11.05 | 13 | 8.06 | 64,700 |
| A6 | 180 | 13.6 | 10.40 | 13 | 8.47 | 75,700 |
| A7 | 182 | 12.7 | 12.26 | 11 | 7.81 | 68,593 |
| A8 | 145 | 14.3 | 12.95 | 11 | 8.38 | 55,000 |
| A9 | 161 | 8.6 | 8.42 | 7 | 5.11 | 35,200 |
| A10 | 117 | 7.2 | 6.75 | 3 | 5.81 | 24,800 |
| Direction | higher is better | lower is better | lower is better | higher is better | higher is better | lower is better |
The method defines between four and five breakpoints for every criterion, and builds and solves a linear programming model consistent with the decision-maker's ranking A1≻A2≻…≻A10.
| Car | Total Utility | Rank |
|---|---|---|
| A1 | 0.6898 | 1 |
| A2 | 0.6798 | 2 |
| A3 | 0.6087 | 3 |
| A4 | 0.5987 | 4 |
| A5 | 0.5887 | 5 |
| A6 | 0.5787 | 6 |
| A7 | 0.5687 | 7 |
| A8 | 0.5587 | 8 |
| A9 | 0.5487 | 9 |
| A10 | 0.5387 | 10 |
The result reads as follows. The model was solved without error (F*=0); an additive utility function fully consistent with the decision-maker's ranking of the ten cars was found. A1 and A2 (the Peugeot 505 GR and similar upper-segment cars) receive the highest utility, and A10 (a small, modest car) the lowest.
The evaluator hesitates here: the utility gap between every consecutive car from A3 to A10 is exactly the smallest permitted threshold (0.01). This shows that the model found the tightest possible solution, but that these eight cars are separated from one another only by a formal threshold, and that the order among them could easily scramble under a small change in the data. By contrast, the gap between A2 and A3 (0.071) is markedly larger; there is a more robust distinction between these two groups (the upper-segment A1-A2, and the middle-and-lower-segment A3-A10).
In the report: "All ten cars were reproduced with a utility function fully consistent with the decision-maker's own ranking (F*=0). The gap between A1 and A2 is small (0.01), but the separation of these two cars from the group starting at A3 (0.071) is more robust. The ranking from A3 to A10 rests only on the smallest permitted threshold and is sensitive to small changes in the data."
Source: Jacquet-Lagrèze and Siskos (1982), §3 Numerical Application, Table 3-4, Figure 4. The figures are taken from the paper's own table; DecisionMind's UTA engine produces the same result, with F*=0 and a ranking agreement (Kendall's tau) of 1.0, as reported in the paper. Note: the DecisionMind team is separately reviewing single-criterion direction-test behaviour for this class of method, which is re-solved against a reference ranking.
2. E-commerce: A Reference Ranking in the Choice of Courier Firm
An e-commerce platform has ranked four courier firms as K1≻K2≻K3≻K4 based on its past experience. There are three criteria: average delivery time (lower is better), damage/loss rate (lower is better), and customer satisfaction score (higher is better). UTA will search for a utility function consistent with this reference ranking.
The method defines breakpoints for every criterion, and builds and solves a model consistent with the platform's ranking K1≻K2≻K3≻K4. Suppose the model is solved without error (F*=0), and the utility function found gives the customer satisfaction score a higher relative weight than the other two criteria.
The platform hesitates here: when it wants to test a fifth courier firm (K5), this firm cannot be entered directly into the model because it was not included in the reference ranking; it can only receive a provisional estimated score from the existing utility function. K5's true standing remains unsettled until it is added to the reference ranking and the model is re-solved.
In the report: "A utility function fully consistent (F*=0) with the reference ranking of the current four courier firms has been found; when a new courier firm is added, the reference ranking must be updated and the model re-solved."
3. Examination Centre: Indifference in the Choice of Examination Software Supplier
A computer-based examination centre's committee will choose among three examination software suppliers. There are three criteria: system stability score (higher is better), setup time (lower is better) and unit licence cost (lower is better). The committee stated that it prefers T1 most, but could not make a clear choice between T2 and T3 and treated the two as equally preferred (T1≻T2~T3).
The method takes the equal preference between T2 and T3 as a constraint: these two suppliers' total utility values must be equal. Suppose the model is solved with this constraint at a small error term (F*=0.02); this shows that the differences between T2 and T3 on the other criteria do not exactly match the assumption of equal preference.
The committee hesitates here: it must clarify whether it genuinely sees T2 and T3 as equal, or called them equal only because it could not distinguish between them. An F*>0 result reveals this uncertainty not as a calculation error, but as an indicator of the committee's own indecision.
In the report: "With the committee's equal preference between T2 and T3, the model was solved with a small inconsistency (F*=0.02); clarifying the distinction between these two suppliers on the committee's part would improve the model's consistency."
4. What Not to Do
Had the reference ranking in the car case been entered as a dictionary in the form {car: rank} and processed by the order of entry into the dictionary rather than by the rank value, the model would have been built with the wrong ranking and the result would have become meaningless. A second error is reversing the direction of a cost criterion, such as fuel consumption or price, by adjusting the criterion range and then reversing it a second time separately; this double reversal breaks the direction again. A third error is treating the 0.01 gaps from A3 to A10 as equally reliable as the 0.071 gap between A2 and A3; the former is only the smallest permitted threshold and can easily change with a small change in the data.
Sources
For the formulas behind each step, the intermediate tables and citation formats (BibTeX, RIS, APA), see the DecisionMind method page: decisionmind.app/library/uta
Jacquet-Lagrèze, E., & Siskos, J. (1982). Assessing a set of additive utility functions for multicriteria decision-making, the UTA method. European Journal of Operational Research, 10(2), 151-164. DOI: 10.1016/0377-2217(82)90155-2
Siskos, Y., Grigoroudis, E., & Matsatsinis, N. F. (2005). UTA methods. In Multiple Criteria Decision Analysis: State of the Art Surveys (pp. 297-344). Springer. DOI: 10.1007/0-387-23081-5_8
Patiniotakis, I., Apostolou, D., & Mentzas, G. (2011). Fuzzy UTASTAR: A method for discovering utility functions from fuzzy data. Expert Systems with Applications, 38(12), 15463-15474. DOI: 10.1016/j.eswa.2011.06.014
Wu, X., & Liao, H. (2023). Value-driven preference disaggregation analysis for uncertain preference information. Omega, 115, 102793. DOI: 10.1016/j.omega.2022.102793