Problem formulation
A large number of methods of solving multi-criteria problems have been developed, and this trend seems set to continue. Wallenius et al. (2008) showed that the number of academic publications related to MCDA is steadily increasing. This proliferation is not only due to researchers’ impressive productivity but also to the development of MCDA methods specific to certain types of problems. Roy (1981) has described four types of problem:
-
1.
Choice problem (\({P} \cdot \alpha \)): the goal is to select the single best action or to reduce the group of actions to a subset of equivalent or similar actions.
-
2.
Sorting problem (\({P} \cdot \beta \)): actions are sorted into predefined, ordered categories. This method is useful for repetitive and/or automatic use. It can also be used for screening in order to reduce the number of actions subjected to more detailed consideration.
-
3.
Ranking problem (\({P} \cdot \gamma \)): actions are placed in decreasing order of preference. The order can be partial, if we consider incomparable actions, or complete.
-
4.
Description problem (\({P} \cdot \delta \)): the goal is to help to describe actions and their consequences.
Additional problem formulations have also been proposed:
-
5.
Elimination problem (Bana e Costa 1996): a particular case of the sorting problem.
-
6.
Design problem: the goal is to identify or create a new action that will meet the goals and aspirations of the decision-maker (Keeney 1992).
PROMETHEE (Brans and Mareschal 1994, 2005) is a multi-criteria method that belongs to the family of the outranking methods. It has been easily adapted to solve all the problems formulations (Mareschal et al. 2010). The aim of this paper is to present a MCDA-based solution to a new type of problem, namely the productivity problem. The majority of MCDA tools allow to assess the effectiveness: namely an alternative is said to be effective when it meets the output target. The MCDA methods allow to collapse multi-dimensional outputs into a single index that can be used as measure of effectiveness. The major shortcoming of effectiveness is that it is based just on the levels of output, and it does not deal with resource used to produce the output. For instance, an alternative could be ineffective because it has got a very limited resource. This is the reason why the most commonly used measure of performance is productivity (Ray and Chen 2015).
-
7.
Productivity problem: the goal is to assess the efficient utilisation of resources in the production.
The usual measure of productivity is a single indicator like output per worker. However, when there is more than one input (like labour and capital) and more than one output, the ratio Output/Workers fails to account for the use of all the inputs used and all the output produced. In order to overcome this shortcoming, we propose a MCDA method to build an aggregate measure of the inputs, and an aggregate measure of the outputs, and we assess productivity by means of relation between these two indices.
In the next subsections, we explain how we adapted PROMETHEE to solve this problem.
Method description
As with any other multi-criteria method, we consider a set of n possible actions \(A=\{ {a_1 ,a_2 ,\ldots ,a_n }\}\) which are evaluated according to a set of k criteria \(C=\{ {c_1 ,c_2 ,\ldots ,c_k }\}\). The main difference between PPA and the other methods in the PROMETHEE family is that the criteria are split into two groups: input and output criteria. The processing of the data is kept separate. For each criterion \(c_i\), and for each pair of actions ( a, b), the decision-maker expresses his/her preference by means of a preference function \(P_i\): the preference degree \(P_i( {a,b})\) is a number between 0 and 1 that indicates the extent to which action a is preferred to action b based on criterion \(c_i\). Six typical preference function shapes are proposed (Brans and Vincke 1985): usual function, U-shape, Level (Fig. 2), V-shape, V-shape with indifference (Fig. 1) and Gaussian (Fig. 3). The usual (\({p} = {q} = 0\)), V-shape (\({p} = 0\)) and U-shape (\({p} = {q}\)) are particular cases of the V-shape with indifference (Fig. 1), where p is the indifference and q the preference threshold on the axis d, which represents the score of an action on the given criterion.
A multi-criteria preference index is then calculated as a weighted sum of the single-criterion preference degrees:
$$\begin{aligned} \pi ( {a,b})= \sum \limits _{i=1}^k {P}_{i} ({a,b})\cdot w_i. \end{aligned}$$
(1)
The weights \(w_i\) represent the relative importance of each criterion in the decision.
As each action is compared with the other \(n-1\) actions, the two following preference flows are defined:
-
Positive flow
$$\begin{aligned} \Phi ^{+}(a)=\frac{1}{n-1}\sum \limits _{x\in A}^ \pi ({a,x}). \end{aligned}$$
(2)
where n is the number of actions in set A.
This score represents the global strength of action a relative to all the other actions and the aim is to maximise it.
-
Negative flow
$$\begin{aligned} \Phi ^{-}\left( a \right) =\frac{1}{n-1} \sum \limits _{x\in A}^\pi \left( {x,a} \right) . \end{aligned}$$
(3)
This score represents the global weakness of a relative to all the other actions and the aim is to minimise it.
The net flow is the balance between the two previous flows and is given by:
$$\begin{aligned} \Phi (a)=\Phi ^{+}(a)-\Phi ^{-}(a). \end{aligned}$$
(4)
The positive and negative flows are used to build the PROMETHEE I partial ranking, whilst the net flow is the basis for the PROMETHEE II complete ranking: all the actions can be ranked in order of net flow value.
As PPA is based on PROMETHEE, it inherits its advantages. In particular, weights and preference functions can be assigned to criteria. If the criteria weights are known a priori by the decision-maker, this is important information which should be added to the model. Applying a preference function can also result in better representation of reality because changes in inputs (resources) and outputs (production) do not always have a linear effect on productivity. An increase in facility spending of 1000 Euros on an existing 10,000 Euro bill does not necessarily have the same effect as an increase of 1000 Euros on a 1000,000 Euro bill. Furthermore, in PROMTHEE all criteria can be expressed in their own units and thus there is no scaling effect. No normalisation of the scores is required, which avoids the drawback of the ranking depending on the choice of normalisation method (Tofallis 2008; Ishizaka and Nemery 2011). A detailed, technical discussion of the normalisation effect in the specific case of universities is given in Tofallis (2012).
Productivity measurement
The interpretation of net flows in PPA depends on the set of output and input criteria used. The higher the net flows of an action’s outputs and the lower the net flows of its inputs, the better it is.
In order to evaluate performances on the basis of the net flows of outputs and inputs, we define the PPA production possibility set \(({{\Psi }_\mathrm{PPA}})\) as:
$$\begin{aligned} {\Psi }_\mathrm{PPA}= & {} \left\{ \left( {{\Phi }_\mathrm{I} ,{\Phi }_\mathrm{O} } \right) \in R^{2}|{\Phi }_\mathrm{O} \le {\mathop {\sum }\limits _{i=1}^n} \gamma _i {\Phi }_{\mathrm{O}i} ;{\Phi }_\mathrm{I} \right. \nonumber \\\ge & {} \left. {\mathop {\sum }\limits _{i=1}^n} \gamma _i {\Phi }_{\mathrm{I}i} ;{\mathop {\sum }\limits _{i=1}^n} \gamma _i =1;\gamma _i \ge 0,i=1,\ldots ,n \right\} . \end{aligned}$$
(5)
where \({\Phi }_\mathrm{I}\) is the net input flow, and \({\Phi }_\mathrm{O}\) is the net output flow.
In line with the DEA variable return to scale production possibility set (Banker et al. 1984) we assume that (Cooper et al. 2004, p 42):
-
1.
All observed activities\(\left( {{\Phi }_{\mathrm{I}i} ,{\Phi }_{\mathrm{O}i} } \right) \, ( {i=1,\ldots ,n})\) belong to \({\Psi }_\mathrm{PEA}\);
-
2.
For an activity \(\left( {{\Phi }_\mathrm{I} ,{\Phi }_\mathrm{O} } \right) \) in \({\Psi }_\mathrm{PPA} \), any activity \(\left( {\overline{\Phi _\mathrm{I}} , \overline{\Phi _\mathrm{O}}} \right) \) with \( \overline{\Phi _\mathrm{I}}>{\Phi }_\mathrm{I}\) and \(\overline{\Phi _\mathrm{O}} <{\Phi }_\mathrm{O}\) is included in \({\Psi }_\mathrm{PEA}\). That is, any activity with net input flow of not less than \({\Phi }_\mathrm{I}\) and net output flow no greater than \({\Phi }_\mathrm{O}\) is feasible.
-
3.
Any semi-positive convex linear combination of activities in \({\Psi }_\mathrm{PPA}\) belongs to \({\Psi }_\mathrm{PPA}\).
The production possibility set is a polyhedral convex set whose vertices correspond to all the actions that are not dominated by another action, i.e. no action simultaneously has higher net output flow and lower net input flow. The PPA frontier can easily be represented graphically (Sect. 2.4).
It worth noting that, unlike the original DEA (Charnes et al. 1978; Banker et al. 1984), inputs and outputs are not explicitly considered in the production possibility set (5). Similar approaches can be found in more recent DEA applications. One of the most popular of these approaches is PCA-DEA (see Ueda and Hoshiai 1997; Adler and Golany 2001, 2002; Adler and Yazhemsky 2010), in which DEA is used on the Principal Components of the original variables.
A second difference from the original DEA is that if one action changes its inputs and outputs, it can modify the inputs and outputs of other actions in the production possibility set (5). This feature is also displayed in other DEA model, for example by the model of Muñiz (2002), in which indexes of efficiency obtained by DEA in the first stage are used as inputs in the second stage. Other examples of DEA models sharing this feature are all the DEA applications on data pre-treated with specific normalisations (such as max–min, Nardo et al. 2008), for instance the model used in Mizobuchi (2014).
To measure the distance to the frontier in PPA, we use an algorithm based on the standard additive model introduced by Charnes et al. (1985) and elaborated by Banker et al. (1989). The algorithm is based on two steps. The first step measures the input distance as:
$$\begin{aligned}&{\max } {{\varvec{\Delta }}}{_{{{\varvec{\Phi }}}_{\varvec{I}}}}_{\varvec{k}} \nonumber \\&{{{\varvec{\Phi }}}_{{{\varvec{I}}}_{{\varvec{k}}}} =\sum \limits _{{\varvec{j}}=1}^{\varvec{n}} {{\varvec{\Phi }} }_{{\varvec{I}}_{\varvec{j}}} {\varvec{\lambda }}_{\varvec{j}} +{{\varvec{\Delta }} }{_{{{\varvec{\Phi }}}_{\varvec{I}}} } _{\varvec{k}}} \nonumber \\&{{{\varvec{\Phi }} }_{{\varvec{O}} _{\varvec{k}}} \le \sum \limits _{{\varvec{j}}=1}^{\varvec{n}} {{\varvec{\Phi }} }_{{\varvec{O}} _{\varvec{j}}} {\varvec{\lambda }}_{\varvec{j}}} \nonumber \\&{\sum \limits _{{\varvec{j}}=1}^{\varvec{n}} {\varvec{\lambda }}_{\varvec{j}} =1} \nonumber \\&{{\varvec{\lambda }}_{\varvec{j}} \ge 0;{\varvec{j}}=1,\ldots ,{\varvec{n}}} \nonumber \\&{{{\varvec{\Delta }} }{_{{{\varvec{\Phi }} }_{\varvec{I}}} } _{\varvec{k}} \ge 0.} \end{aligned}$$
(6)
where \({{\varvec{\Delta }}}_{{{\Phi }_{{I}}} _{\varvec{k}}}\) is the input distance to the frontier for the actions k under evaluation;
-
\({\Phi }_{\mathrm{I}_{\varvec{k}}}\) is the net output flow of action k in the evaluation;
-
\({\Phi }_{\mathrm{O}_{\varvec{k}}}\) is the net output flow of action k in the evaluation;
-
\(\lambda _j\) is one element of the intensity vector.
In the second step we measure the output distance as:
$$\begin{aligned}&{\max {{\varvec{\Delta }} }_{{{{\varvec{\Phi }} }_{{\varvec{O}} }} _{\varvec{k}}}} \nonumber \\&{{{\varvec{\Phi }} }_{{\varvec{I}} _{\varvec{k}}} \ge \sum \limits _{{\varvec{j}}=1}^{\varvec{n}} {{\varvec{\Phi }} }_{{\varvec{I}} _{\varvec{j}}} {\varvec{\lambda }}_{\varvec{j}} } \nonumber \\&{{{\varvec{\Phi }} }_{{\varvec{O}} _{\varvec{k}}} =\sum \limits _{{\varvec{j}}=1}^{\varvec{n}} {{\varvec{\Phi }} }_{{\varvec{O}} _{\varvec{j}}} {\varvec{\lambda }}_{\varvec{j}} -{{\varvec{\Delta }} }_{{{{\varvec{\Phi }} }_{{\varvec{O}}} } _{\varvec{k}}} } \nonumber \\&{\sum \limits _{{\varvec{j}}=1}^{\varvec{n}} {\varvec{\lambda }}_{\varvec{j}} =1} \nonumber \\&{{\varvec{\lambda }}_{\varvec{j}} \ge 0;{\varvec{j}}=1,\ldots ,{\varvec{n}}} \nonumber \\&{{{\varvec{\Delta }} }_{{{\varvec{V O}}} _{\varvec{k}}} \ge 0.} \end{aligned}$$
(7)
where \({{\varvec{\Delta }} }_{{{\Phi }_{\mathrm{O}}}_{\varvec{k}}}\) is the output distance to the frontier for the actions k under evaluation.
Finally, the minimum distance to the frontier defines the PPA inefficiency as:
$$\begin{aligned} {\min } \Delta ={\min }\left[ {{\begin{array}{ll} {{{\varvec{\Delta }} }_{{{\Phi }_\mathrm{I}}_k} ,}&{} {{{\varvec{\Delta }} }_{{{\Phi }_{\mathrm{O}} } _k }} \\ \end{array} }} \right] . \end{aligned}$$
(8)
PPA frontier visualisation
The productivity of the actions can be depicted in a two-dimensional graph (Fig. 4). The range of the two axes is \({-}\,1\) to 1, and they represent the net flows of the inputs and outputs. Four categories of action can be defined:
- Efficient:
-
This type of action produces a high output (i.e. high net output flow) with a low input (i.e. low net input flow). Thus efficient actions appear in the top-left quadrant of the graph (e.g. actions B and C in Fig. 4).
- Effective:
-
This type of action is defined solely in terms of its outputs (high) and thus appears in the top-right quadrant (e.g. actions D and E in Fig. 4).
- Frugal:
-
This type of action minimises spending and is represented by the bottom-left quadrant (e.g. A in Fig. 4).
- Inefficient:
-
This type of action has high inputs and low outputs and sits in bottom-right quadrant (e.g. G in Fig. 4).
Any action that is not dominated in terms of Input/Output net flows lies on the PPA frontier (shown in red on Fig. 4). Actions that are not on the frontier can be improved by taking real action(s) that are closest to the frontier as an example (e.g. in Fig. 4 action F can be improved by looking at the example of action C).
An action’s productivity ranking is determined by measuring the distance between it and the productivity frontier. This distance can be measured in various ways, e.g.:
-
Horizontally, on the input axis (x), by programme (6): the input orientation assumes a given output level and searches for improvements in inputs that will bring the action closer to the PPA frontier.
-
Vertically, on the output axis (y), by programme (7): the output orientation assumes a given level of inputs and searches for improvements in outputs that will bring the action closer to the PPA frontier.
-
Along both axes simultaneously: if the decision-maker is not facing any constraints and has the control over both inputs and outputs, the orientation will depend on his/her objectives. For instance, by choosing the minimum between the two previous measures (8), this shows how an action can be efficient when either input or output values are adjusted.
PPA has been implemented in two stages analysis:
-
1.
The input and output net flows have been estimated by Visual PROMETHEE software (http://www.promethee-gaia.net/software.html), which is free to academics.
-
2.
In order to estimate the output and input distance to the frontier with programme (6) and programme (7), an optimisation code in R has been developed and can be forwarded on request.