Introduction

Performance evaluation is a critically important procedure for the companies and organizations operating in the modern business world, where survival in the fiercely competitive business environment requires maintaining high levels of performance and efficiency. Thus, performance evaluations of business and production units in its many aspects have long been of interest to organizational managers and corporate executives. One of the major challenges ahead of proper performance evaluation is the lack of access to an accurate production function because of the complexity of the production process, the change in production technology, the impact of external factors on performance, the large size of data and operations, and the abrupt changes in policy to address acute problems. Access to production function is of immense importance for microeconomic analyses, as it allows managers to easily evaluate the performance of business units. Parametric methods have long been among the leading methods of estimation of production function and thereby unit performance. In these methods, user assumes a particular form for production function and then determines the parameters of the function with the help of mathematical techniques [7].

Farrel [22] proposed a non-parametric method for this application, which later became the basis of another method called data envelopment analysis (DEA). DEA was developed by Charnes et al. [11] to solve unit performance evaluation problems with the Constant Returns-to-Scale (CRS). DEA is a non-parametric programming technique for measuring the relative efficiency of multiple decision-making units (DMUs) tasked with transforming multiple inputs into multiple outputs. In DEA, the weights are set in such a way as to maximize the performance of the evaluated unit (DMU) relative to the rest of the units. To evaluate the performance of DMUs, one must first determine the production possibility set (PPS) and then obtain the projection of DMUs on the efficient boundary (frontier) of PPS. This frontier represents the maximum output that can be obtained by a particular input, or the least input that is needed to produce a particular output. The DMUs that are located on this frontier are called efficient and the remaining DMUs are inefficient. Any inefficient DMU can be made efficient by reducing its inputs or increasing its outputs. Banker et al. [8] expanded the DEA theory for the Variable Returns-to-Scale (VRS). In DEA, the efficiency level is very sensitive to the initial data, so the use of scattered data will lead to significant variations in DMUs’ efficiency levels. Furthermore, in the theoretical problems and especially those commonly solved by DEA models, inputs and outputs are usually expressed with exact values. This is often inconsistent with the reality of business world, where, in many cases, our knowledge about the production process is inaccurate and the available data are imprecise or obscure. This deficiency has been the primary driver for the combination of DEA models with fuzzy set theory. The general assumption of DMU performance evaluation is that efficiency can be improved by reducing inputs or increasing outputs. The traditional models like CCR and BCC are based on this assumption. But it is false to assume that all organizations seek to minimize all their inputs and maximize all their outputs, as inputs and outputs could be desirable or undesirable based on the process and objectives. Therefore, such cases require a different analytical approach that could account for desirability and undesirability of parameters.

The main contributions of this paper are sevenfold: (1) a novel DEA framework in crisp and fuzzy environments is developed to overall assessing of each DMU in the presence of undesirable outputs. (2) In contrast to most existing approaches, which provide crisp efficiency measures, the developed fuzzy framework provides fuzzy efficiency measures. (3) In contrast to existing method [26], two virtual fuzzy DMUs called fuzzy ideal DMU (FIDMU) and fuzzy anti-ideal DMU (FADMU) are introduced into fuzzy DEA (FDEA) in the presence of undesirable outputs. (4) In contrast to existing method [26, 50], the exact form of membership function of the fuzzy relative closeness is determined to give an overall assessment of each DMU. (5) According to the developed framework, because of using fuzzy arithmetic approach, less linear programming models are solved in order to full ranking of DMUs in comparison with Puri and Yadav’s method [50] and Hatamai-Marbini et al.’s method [26]. (6) In contrast to existing method [50] that evaluates the performance of each fuzzy DMU based on optimistic perspective, the proposed framework evaluates each fuzzy DMU from both the optimistic and pessimistic perspectives. (7) The complexity of computation is greatly reduced compared with commonly used existing methods [26, 50] in the literature.

The rest of this paper is organized as follows: A comprehensive literature review on FDEA models is presented in "Literature review". In "Preliminaries", we review some necessary concepts and backgrounds on fuzzy arithmetic. In "The proposed method", we present a methodology for solving the FDEA models with undesirable outputs based on the positive ideal point (PIP) and negative ideal point (NIP) formulations, and then propose a fuzzy ranking algorithm for comparison and ranking of fuzzy efficiencies of DMUs. In "Numerical example", we solve a numerical example to demonstrate the performance of the proposed method. Finally, the conclusions are presented in "Concluding remarks".

Literature review

The fuzzy set theory introduced by Zadeh [78] is a general and natural extension of the ordinary set theory. Using the fuzzy concepts, the classic management techniques can be transformed into their fuzzy forms to be used more effectively in various management tasks such as decision making, policy making and planning. With the fuzzy management science, one can design a model that, like humans, would be capable of intelligent processing of qualitative information. Thus, the fuzzy management science allows us to introduce some flexibility to the classical crisp models by incorporating in them concept such as knowledge, experience and human judgment in order to achieve more practical solutions. In recent years, many researchers have worked on the implications and utility of imprecise and ambiguous qualitative data for DEA and performance evaluation in general. An overview of the papers which studied FDEA models and discussed regarding solution methodologies can be summarized as follows.

Sengupta [62] proposed a fuzzy programming approach to solve FDEA models where the objective function and constraints are not satisfied based on crisp definitions. Triantis et al. [68] fuzzified the non-radial DEA models for dealing with imprecise data. In this approach, the possible values of parameters of fuzzy programming model were considered as an interval, where the lower bound represents uncertainty and risk-free value and the upper bound represents the impossible value. Sheth [63] developed a method for the use of goal planning technique to solve DEA models in fuzzy environment. Cooper et al. [14] developed a model that utilizes a combination of imprecise data with known bounds and exact data of evaluation. Gu [24] modified the CCR model with symmetric TFNs. In this study, first the α-cut method was applied on constraints and the obtained intervals were compared, and then the efficiency of units was evaluated by solving two linear programming problems. Saati et al. [59] proposed another approach to FDEA, where, instead of comparing equality or inequality of intervals, a variable defined within the interval is used to not only satisfy the constraints, but also optimize the efficiency values. Wu [74] and Wang and Luo [70] presented a method for ranking DMUs in FDEA based on the theory of ideal and anti-ideal units. Peykani et al. [49] proposed a novel fuzzy DEA model based on general fuzzy measure to consider the preferences of DMUs. Arya and Yadav [4] developed intuitionistic fuzzy DEA and dual intuitionistic fuzzy DEA to determine the intuitionistic fuzzy efficiencies of DMUs. Arana-Jiménez et al. [2] proposed a fuzzy DEA slacks-based approach to deals with the problem of efficiency assessment. Bagheri et al. [6] proposed a fuzzy data envelopment analysis approach for solving fuzzy multi objective transportation problem. Arana-Jiménez et al. [3] proposed a new radial, input-oriented and fully fuzzy DEA approach for assessing the relative efficiency of a set of DMUs. Singh and Pant [64] proposed a fuzzy DEA approach for analyzing the performance of eight selected paper mills of India. The currently available methods for solving FDEA models can be classified into six categories shown in Table 1.

Table 1 A brief summary of fuzzy DEA methods

An evaluation of the efficiency of DMUs should be able to account for the fact that some outputs and inputs may be desirable and others may be undesirable. A simple example of undesirable output is the number of defective products, which should be reduced. In the production processes, an inefficient unit that produces pollution and waste alongside the final product has two types of outputs (desirable and undesirable), of which one must be increased and the other must be reduced. This is slightly different from the general DEA models, and therefore requires a different approach to desirable and undesirable parameters. In such conditions, the model should be developed with the purpose of decreasing the undesirable parameters. Several models with undesirable inputs and outputs have already been developed to address such conditions. The notable works carried out in this area include the studies of Chung et al. [13], Ebrahimnejad [16], Fӓre et al. [21] Jahanshahloo et al. [29] Pathomsiri et al. [47], Seiford et al. [61], Nasseri et al. [43], Ebrahimnjead et al. [17, 18]. Scheel et al. [60] used the data transformation method to convert the undesirable elements to desirable elements while preserving the model linearity. According to Scheel et al. [60], the methods of aggregating undesirable outputs in DEA can be categorized into direct and indirect approaches. In the indirect approach, a monotonic decreasing function can be used to transform the values of undesirable outputs so that they could be treated as desirable outputs. In contrast, the direct approach means avoiding such data transformation and instead incorporating the undesired outputs directly into the DEA model. One of the direct methods of dealing with undesirable outputs is the approach proposed by Korhonen and Luptacik [35] that aggregates all desirable and undesirable outputs using a weighted sum operator. However, in this model, the weight factors of the undesirable outputs must be negative, so the relative efficiency of some DMUs could become negative as well. Later, Puri and Yadav [50] modified this method to resolve this issue. We extend the DEA model with undesirable outputs proposed by Puri and Yadav [50] from the perspective of fuzzy arithmetic to deal with fuzziness in input and output data in DEA.

Preliminaries

This section is composed of three subsections to present some preliminaries about the fuzzy sets theory, DEA model with IDMU or ADMU and DEA model with undesirable outputs [19, 27].

Fuzzy set theory

Definition 1

A fuzzy set \(\tilde{A},\) defined on universal set of real numbers, \({\mathbb{R}}\), is said to be a fuzzy number if its membership function has the following characteristics:

  • \(\tilde{A}\) is convex, i.e., \(\forall x,y \in {\mathbb{R}},\,\forall \lambda \in {[}0,1{]},\,\mu_{{\tilde{A}}} {(}\lambda x{ + (1 - }\lambda {)}y \ge {\min}\left\{ {\mu_{{\tilde{A}}} {(}x{),}\mu_{{\tilde{A}}} {\text{(y)}}} \right\},\)

  • \(\tilde{A}\) is normal, i.e., \(\exists \,\overline{x}\, \in \,R;\,\,\mu_{{\tilde{A}}} (\overline{x}) = 1\), and

  • \(\mu_{{\tilde{A}}}\) is piecewise continuous.

Definition 2

A triangular fuzzy number \(\tilde{A},\) denoted by \(\tilde{A} = (a^{L} ,a^{M} ,\,a^{U} )\) is a fuzzy set on \({\mathbb{R}}\) with the membership function as follows:

$$ \mu_{{\tilde{A}}} (x)\,\, = \,\left\{ \begin{array}{ll} \frac{{x - \,a^{L} }}{{a^{M} - a^{L} }}, & a^{L} \, \le \,x\, \le a^{M} , \hfill \\ \frac{{a^{U} - x}}{{a^{U} - a^{M} }},& a^{M} \le \,x\, \le a^{U} . \hfill \\ \end{array} \right. $$

We denote all triangular fuzzy numbers by \(F\left( {\mathbb{R}} \right)\).

Definition 3

A triangular fuzzy number \(\tilde{A} = (a^{L} ,a^{M} ,\,a^{U} )\) is said to be a non-negative (respectively, positive) fuzzy number if, and only if, \(a^{L} \ge 0\)(respectively, \(a^{L} > 0\)).

Definition 4

Let \(\tilde{A} = (a^{L} ,a^{M} ,\,a^{U} )\) and \(\tilde{B} = \,(b^{L} ,b^{M} ,\,b^{U} )\) be two triangular fuzzy numbers and \(k \in R\). Then, the arithmetic operations on \(\tilde{A}\) and \(\tilde{B}\) are defined as follows:

  1. (i)

    \(\tilde{A} + \tilde{B} = (a^{L} + b^{L} ,a^{M} + b^{M} ,\,a^{U} + b^{U} )\),

  2. (ii)

    \(\tilde{A} - \tilde{B} = (a^{L} - b^{U} ,a^{M} - b^{M} ,\,a^{U} - b^{L} )\),

  3. (iii)

    \(\tilde{A} \times \tilde{B} \approx (a^{L} b^{L} ,a^{M} b^{M} ,\,a^{U} b^{U} ),\,\,a^{L} ,\,b^{L} \ge 0\),

  4. (iv)

    \(\tilde{A}/\tilde{B} \approx (\frac{{a^{L} }}{{b^{U} }},\frac{{a^{M} }}{{b^{M} }},\,\frac{{a^{U} }}{{b^{L} }}),\,\,\,\,\,\,a^{L} \ge 0,\,\,b^{L} > 0.\),

  5. (v)

    \(k \ge 0,\,\,k\tilde{A} = (ka^{L} ,ka^{M} ,\,ka^{U} )\),

  6. (vi)

    \(k < 0,\,\,k\tilde{A} = (ka^{U} ,ka^{M} ,\,ka^{L} )\).

Ranking fuzzy numbers plays a very important role in decision-making, optimization, and other usages. The past few decades have seen a large number of approaches investigated for ranking fuzzy numbers [72, 75, 76]. Herein, we describe a novel ranking approach using integral values [41, 77].

Suppose there are \(n\) fuzzy numbers \(\tilde{A}_{i} = (a_{i}^{L} ,a_{i}^{M} ,\,a_{i}^{U} ),\,i = 1,2, \ldots ,n\), each with the left membership function \(\mu_{{\tilde{A}_{i} }}^{L} (x)\,\, = \frac{{x - \,a_{i}^{L} }}{{a_{i}^{U} - a_{i}^{L} }}\) and right membership function \(\mu_{{\tilde{A}_{i} }}^{R} (x)\,\, = \frac{{a_{i}^{U} - x}}{{a_{i}^{U} - a_{i}^{M} }}\). The minimum crisp value \(x_{\min }\) and the maximum crisp value \(x_{\max }\) are defined as \(x_{\min } = \inf {\mkern 1mu} \bigcup\nolimits_{i = 1}^{n} {\left( {a_{i}^{L} ,{\mkern 1mu} a_{i}^{U} } \right)}\) and \(x_{\max } = \sup {\mkern 1mu} \bigcup\nolimits_{i = 1}^{n} {\left( {a_{i}^{L} ,{\mkern 1mu} a_{i}^{U} } \right)}\), respectively.

Definition 5

The left and right integral values of \(\tilde{A}_{i} = (a_{i}^{L} ,a_{i}^{M} ,\,a_{i}^{U} )\) with regard to \(x_{\min }\) are defined as follows [41, 77]:

$$ S_{\min }^{L} (\tilde{A}_{i} ) = (a_{i}^{M} - x_{\min } ) - \int_{{a_{i}^{L} }}^{{a_{i}^{M} }} {\mu_{{\tilde{A}_{i} }}^{L} (x)\,{\text{d}}x} = \frac{{a_{i}^{L} + a_{i}^{M} }}{2} - x_{\min } , $$
(1)
$$ S_{\min }^{R} (\tilde{A}_{i} ) = (a_{i}^{M} - x_{\min } ) + \int_{{a_{i}^{M} }}^{{a_{i}^{U} }} {\mu_{{\tilde{A}_{i} }}^{L} (x)\,{\text{d}}x} = \frac{{a_{i}^{M} + a_{i}^{U} }}{2} - x_{\min } . $$
(2)

It should be noted that the fuzzy number \(\tilde{A}_{i}\) becomes larger if \(S_{\min }^{L} (\tilde{A}_{i} )\) and \(S_{\min }^{R} (\tilde{A}_{i} )\) are larger.

Definition 6

The total integral value of \(\tilde{A}_{i}\) with regard to \(x_{\min }\) with index of optimism \(\alpha \in [0,\,1]\) is then defined as [41, 77]:

$$ S_{\min }^{\alpha } (\tilde{A}_{i} ) = \alpha S_{\min }^{R} (\tilde{A}_{i} ) + (1 - \alpha )S_{\min }^{L} (\tilde{A}_{i} ) = \frac{1}{2}\left[ {\alpha (a_{i}^{M} + a_{i}^{U} ) + (1 - \alpha )(a_{i}^{L} + a_{i}^{M} ) - 2x_{\min } } \right]. $$
(3)

Definition 7

The left and right integral values of \(\tilde{A}_{i} = (a_{i}^{L} ,a_{i}^{M} ,\,a_{i}^{U} )\) with regard to \(x_{\max }\) are defined as follows:

$$ S_{\max }^{L} (\tilde{A}_{i} ) = (x_{\max } - a_{i}^{M} ) + \int_{{a_{i}^{L} }}^{{a_{i}^{M} }} {\mu_{{\tilde{A}_{i} }}^{L} (x)\,{\text{d}}x} = x_{\max } - \frac{{a_{i}^{L} + a_{i}^{M} }}{2}, $$
(4)
$$ S_{\max }^{R} (\tilde{A}_{i} ) = (x_{\max } - a_{i}^{M} ) - \int_{{a_{i}^{M} }}^{{a_{i}^{U} }} {\mu_{{\tilde{A}_{i} }}^{R} (x)\,{\text{d}}x} = x_{\max } - \frac{{a_{i}^{M} + a_{i}^{U} }}{2}. $$
(5)

It should be noted that the fuzzy number \(\tilde{A}_{i}\) becomes larger if \(S_{\max }^{L} (\tilde{A}_{i} )\) and \(S_{\max }^{R} (\tilde{A}_{i} )\) are smaller.

Definition 8

The total integral value of \(\tilde{A}_{i}\) with regard to \(x_{\max }\) with index of optimism \(\alpha \in [0,\,1]\) is then defined as follows:

$$ S_{\max }^{\alpha } (\tilde{A}_{i} ) = \alpha S_{\max }^{R} (\tilde{A}_{i} ) + (1 - \alpha )S_{\max }^{L} (\tilde{A}_{i} ) = \frac{1}{2}\left[ {2x_{\max } - \left( {\alpha (a_{i}^{M} + a_{i}^{U} ) + (1 - \alpha )(a_{i}^{L} + a_{i}^{M} )} \right)} \right]. $$
(6)

The two distinctive integral values (3) and (5) are combined to form a comprehensive index called the relative closeness (RC) to the total integral value of \(\tilde{A}_{i}\) with regard to \(x_{\min }\) just like the well-known TOPSIS approach in multiple attribute decision making (MADM) as follows:

$$ {\text{RC}}^{\alpha } (\tilde{A}_{i} ) = \frac{{S_{\min }^{\alpha } (\tilde{A}_{i} )}}{{S_{\max }^{\alpha } (\tilde{A}_{i} ) + S_{\min }^{\alpha } (\tilde{A}_{i} )}} = \frac{1}{2}\left[ {\frac{{\alpha (a_{i}^{M} + a_{i}^{U} ) + (1 - \alpha )(a_{i}^{L} + a_{i}^{M} ) - 2x_{\min } }}{{x_{\max } - x_{\min } }}} \right]. $$
(7)

The proposed approach uses \({\text{RC}}^{\alpha } (\tilde{A}_{i} )\) to rank fuzzy numbers. The reason is that the more distance between the fuzzy number \(\tilde{A}_{i}\) and \(x_{\min }\) measured by \(S_{\min }^{\alpha } (\tilde{A}_{i} )\) indicates the higher rank of \(\tilde{A}_{i}\) and the less distance between the fuzzy number \(\tilde{A}_{i}\) and \(x_{\max }\) measured by \(S_{\max }^{\alpha } (\tilde{A}_{i} )\) indicates the higher rank of \(\tilde{A}_{i}\). Therefore, the larger \({\rm RC}^{\alpha } (\tilde{A}_{i} )\) is, the larger is the fuzzy number \(\tilde{A}_{i}\).

It is worth noting that the basic idea of TOPSIS originates from the concept of a displaced ideal point from which the compromise solution has the shortest distance. It will be based on the shortest distance from the ideal and the farthest from the anti-ideal solution. TOPSIS simultaneously considers the distances to both ideal and ant-ideal solutions, and a preference order is ranked according to their relative closeness, and a combination of these two distance measures. With this in mind, the main advantages of the suggested relative closeness index defined in Eq. (7) over other alternatives are (1) giving a scalar value that accounts for both the best and worst alternatives simultaneously, (2) being a simple computation process that can be easily programmed into a spreadsheet, (3) visualizing the performance measures of all alternatives on attributes at least for any two dimensions, and (4) posing a sound logic that represents the rationale of human choice.

DEA model with IDMU or ADMU

In this subsection, we review DEA models with IDMU and ADMU that evaluate DMUs from the viewpoint of the best and worst possible relative efficiency, respectively [70, 74].

Consider a set of \(n\) DMUs, where DMUj consumes \(m\) inputs \(x_{ij} \, (i = 1,\ldots,m)\) to produce \(r\) outputs \(y_{rj} \, (r = 1,\ldots,s)\). An IDMU is a hypothetical DMU which consumes the least inputs to generate the most outputs. An ADMU is a hypothetical DMU which consumes the most inputs to generate the least outputs. The inputs and outputs of \({\text{IDMU}} = (X^{\rm min} ,Y^{\rm max} )\) and \({\text{ADMU}} = (X^{\rm max} ,Y^{\rm min} )\) are defined as follows:

$$ \begin{aligned} x_{i}^{{\min}} = \mathop {\min }\limits_{j} \{ x_{ij} \} ,\,\,\quad x_{i}^{{\max}} = \mathop {\max }\limits_{j} \{ x_{ij} \} ,\,\quad \,i = 1,\ldots,m \hfill \\ y_{r}^{\max } = \mathop {\max }\limits_{j} \{ y_{rj} \} ,\,\quad \,y_{r}^{\min } = \mathop {\min }\limits_{j} \{ y_{rj} \} ,\quad r = 1,\ldots,s{.} \hfill \\ \end{aligned} $$
(8)

The best relative efficiency of IDMU (\(\theta_{I}^{ * }\)) is computed by solving the following fractional programming model:

$$ \begin{aligned} & \theta_{I}^{ * } = {\max}\frac{{\sum\nolimits_{r = 1}^{s} {u_{r}^{{}} y_{r}^{{\max}} } }}{{\sum\nolimits_{i = 1}^{m} {v_{i}^{{}} x_{i}^{{\min}} } }} \hfill \\ & {\text{ s.t.}} \, \theta_{j}^{{}} = \frac{{\sum\nolimits_{r = 1}^{s} {u_{r}^{{}} y_{rj}^{{}} } }}{{\sum\nolimits_{i = 1}^{m} {v_{i}^{{}} x_{ij}^{{}} } }} \le 1\quad \, j = 1,2,\ldots,n \hfill \\ & u_{r}^{{}} \ge \varepsilon \, \forall r{ , }\quad {\text{v}}_{i}^{{}} \ge \varepsilon \, \forall i. \hfill \\ \end{aligned} $$
(9)

The worst relative efficiency of ADMU (\(\varphi_{N}^{ * }\)) is computed by solving the following fractional programming model:

$$ \begin{aligned} & \varphi_{N}^{ * } = {\min}\frac{{\sum\nolimits_{r = 1}^{s} {u_{r}^{{}} y_{r}^{{\min}} } }}{{\sum\nolimits_{i = 1}^{m} {v_{i}^{{}} x_{i}^{{\max}} } }} \hfill \\ & {\text{ s}}{\text{.t}}{. }\frac{{\sum\nolimits_{r = 1}^{s} {u_{r}^{{}} y_{r}^{{\max}} } }}{{\sum\nolimits_{i = 1}^{m} {v_{i}^{{}} x_{i}^{{\min}} } }} \ge \theta_{I}^{ * } \hfill \\ & \varphi_{j}^{{}} = \frac{{ \, \sum\nolimits_{r = 1}^{s} {u_{r}^{{}} y_{rj}^{{}} } }}{{\sum\nolimits_{i = 1}^{m} {v_{i}^{{}} x_{ij}^{{}} } }} \le 1 \, \quad j = 1,2,\ldots,n \hfill \\ & u_{r}^{{}} \ge \varepsilon \, \forall r,\quad v_{i}^{{}} \ge \varepsilon \, \forall i. \hfill \\ \end{aligned} $$
(10)

The best relative efficiency of DMUo (\(\theta_{o}^{ * }\)) using the optimum efficiency of IDMU is computed by solving the following fractional programming model:

$$ \begin{aligned} & \theta_{o}^{ * } = {\text{Max }}\frac{{\sum\nolimits_{r = 1}^{s} {u_{r}^{{}} y_{ro}^{{}} } }}{{\sum\nolimits_{i = 1}^{m} {v_{i}^{{}} x_{io}^{{}} } }} \hfill \\ & {\text{ s}}{\text{.t}}{. }\frac{{\sum\nolimits_{r = 1}^{s} {u_{r}^{{}} y_{r}^{{\max}} } }}{{\sum\nolimits_{i = 1}^{m} {v_{i}^{{}} x_{i}^{{\min}} } }} = \theta_{I}^{ * } \hfill \\ & \theta_{j}^{{}} = \frac{{\sum\nolimits_{r = 1}^{s} {u_{r}^{{}} y_{rj}^{{}} } }}{{\sum\nolimits_{i = 1}^{m} {v_{i}^{{}} x_{ij}^{{}} } }} \le 1\quad j = 1,2,\ldots.n \, \hfill \\ & u_{r}^{{}} \ge \varepsilon \, \forall r ,\quad v_{i}^{{}} \ge \varepsilon \, \forall i. \hfill \\ \end{aligned} $$
(11)

The worst relative efficiency of DMUo (\(\varphi_{o}^{ * }\)) using the optimum efficiency of ADMU is computed by solving the following fractional programming model:

$$ \begin{aligned} & \varphi_{o}^{ * } = {\min}\frac{{\sum\nolimits_{r = 1}^{s} {u_{r}^{{}} y_{ro}^{{}} } }}{{\sum\nolimits_{i = 1}^{m} {v_{i}^{{}} x_{io}^{{}} } }} \hfill \\ & {\text{ s}}{\text{.t}}{. }\frac{{\sum\nolimits_{r = 1}^{s} {u_{r}^{{}} y_{r}^{{\min}} } }}{{\sum\nolimits_{i = 1}^{m} {v_{i}^{{}} x_{i}^{{\max}} } }} = \varphi_{N}^{ * } \hfill \\ & \varphi_{j}^{{}} = \frac{{ \, \sum\nolimits_{r = 1}^{s} {u_{r}^{{}} y_{rj}^{{}} } }}{{\sum\nolimits_{i = 1}^{m} {v_{i}^{{}} x_{ij}^{{}} } }} \le 1\quad j = 1,2,\ldots,n \, \hfill \\ & u_{r}^{{}} \ge \varepsilon \, \forall r,\quad v_{i}^{{}} \ge \varepsilon \, \forall i. \hfill \\ \end{aligned} $$
(12)

Remark 1

The aim of model (11) is to maximize the efficiency of each DMU while at the same time keep the maximal efficiency of the IDMU unchanged. In as same way, the aim of model (12) to minimize the efficiency of each DMU under the condition that the optimal efficiency of the ADMU keeps unchanged. Wang and Luo [70] and Wu [74] integrated the optimal values of models (8)–(12) to provide an overall assessment of each DMU as follows:

$$ {\text{RC}}_{o} = \frac{{\varphi_{o}^{*} - \varphi_{N}^{*} }}{{(\varphi_{o}^{*} - \varphi_{N}^{*} ) + (\theta_{I}^{*} - \theta_{o}^{*} )}}. $$

It is obvious that the bigger \(\varphi_{o}^{*} - \varphi_{N}^{*}\) (difference of efficiencies of DMU under consideration and ADMU) and the smaller \(\theta_{I}^{*} - \theta_{o}^{*}\) (difference of efficiencies of IDMU and DMU under consideration) mean the better performance of DMU under evaluation. Hence, the bigger is the \({\text{RC}}_{o}\) value, the better is the performance of under evaluation DMUo.

DEA model with undesirable outputs

In this subsection, we review the DEA model developed by Puri and Yadav [50] to deal with undesirable outputs.

Consider a set of \(n\) DMUs, where DMUj consumes \(m\) inputs \(x_{ij} \, (i = 1,\ldots,m)\) to produce \(s\) outputs in which \(s_{1}\) outputs are desirable (good) and \(s_{2}\) outputs are undesirable (bad) such that \(s = s_{1} + s_{2}\). The desirable and undesirable outputs are denoted by \(y_{rj}^{g} \, (r = 1,\ldots,s_{1} )\) and \(y_{pj}^{b} \, (p = 1,\ldots,s_{2} )\), respectively. Puri and Yadav [50] modified the model suggested by Korhonen and Luptacik [35] to that with undesirable outputs and proposed the following fractional programming model to determine the efficiency of each DMU in the presence of undesirable outputs:

$$ \begin{aligned} & {\max} \, E_{o} = \frac{{\sum\nolimits_{r = 1}^{{s_{1} }} {u_{r}^{g} y_{ro}^{g} - } \sum\nolimits_{p = 1}^{{s_{2} }} {u_{p}^{b} y_{po}^{b} } }}{{\sum\nolimits_{i = 1}^{m} {v_{i}^{{}} x_{io}^{{}} } }} \hfill \\ & {\text{ s}}{\text{.t}}{. } \, 0 \le E_{j} = \frac{{\sum\nolimits_{r = 1}^{{s_{1} }} {u_{r}^{g} y_{rj}^{g} - } \sum\nolimits_{p = 1}^{{s_{2} }} {u_{p}^{b} y_{pj}^{b} } }}{{\sum\nolimits_{i = 1}^{m} {v_{i}^{{}} x_{ij}^{{}} } }} \le 1\quad j = 1,\ldots,n \, \hfill \\ & u_{r}^{g} \ge \varepsilon \, \forall r,\quad u_{p}^{b} \ge \varepsilon \, \forall p,\quad v_{i}^{{}} \ge \varepsilon \, \forall i. \hfill \\ \end{aligned} $$
(13)

The model (13) is transformed into the following linear programming model by using Charnes–Cooper transformation:

$$ \begin{aligned} & {\min} \, E_{o} = \sum\limits_{r = 1}^{{s_{1} }} {u_{r}^{g} y_{ro}^{g} - } \sum\limits_{p = 1}^{{s_{2} }} {u_{p}^{b} y_{po}^{b} } \hfill \\ & {\text{ s}}{\text{.t}}{. }\sum\limits_{i = 1}^{m} {v_{i}^{{}} x_{io}^{{}} } = 1 \hfill \\ & \sum\limits_{r = 1}^{{s_{1} }} {u_{r}^{g} y_{rj}^{g} - } \sum\limits_{p = 1}^{{s_{2} }} {u_{p}^{b} y_{pj}^{b} } - \sum\limits_{i = 1}^{m} {v_{i}^{{}} x_{ij}^{{}} } \le 0\quad j = 1,\ldots,n, \hfill \\ & \sum\limits_{r = 1}^{{s_{1} }} {u_{r}^{g} y_{rj}^{g} - } \sum\limits_{p = 1}^{{s_{2} }} {u_{p}^{b} y_{pj}^{b} } \ge 0\quad j = 1,\ldots,n, \hfill \\ & u_{r}^{g} \ge \varepsilon \, \forall r,\quad u_{p}^{b} \ge \varepsilon \, \forall p,\quad v_{i}^{{}} \ge \varepsilon \, \forall i. \hfill \\ \end{aligned} $$
(14)

The proposed method

In this section, we first develop a new DEA model with IDMU and ADMU in the presence of undesirable outputs and then the proposed model is extended into a fuzzy environment.

DEA model with undesirable outputs based on IDMU and ADMU

In this subsection, we propose a new methodology for assessing the efficiency of each DMU which is inspired by the work of Puri and Yadav [50] on considering undesirable outputs and the work of Wu [74] on considering virtual DMUs.

The inputs and desirable and undesirable outputs of \({\text{IDMU}} = (X^{{\min}} ,Y^{g\max } ,Y^{{b{\max}}} )\) and \({\text{ADMU}} = (X^{{\max}} ,Y^{{g{\min}}} ,Y^{{b{\min}}} )\) are defined as follows:

$$ \begin{aligned} x_{i}^{{\min}} = \mathop {\min }\limits_{j} \{ x_{ij} \} ,\,\quad x_{i}^{{\max}} = \mathop {\max }\limits_{j} \{ x_{ij} \} ,\,\quad \,i = 1,\ldots,m, \hfill \\ y_{r}^{{g{\max}}} = \mathop {\max }\limits_{j} \{ y_{rj}^{g} \} ,\quad y_{r}^{{g{\min}}} = \mathop {\min }\limits_{j} \{ y_{rj}^{g} \} ,\quad r = 1,\ldots,s_{1} , \hfill \\ y_{p}^{{b{\max}}} = \mathop {\max }\limits_{j} \{ y_{pj}^{b} \} ,\,\quad y_{p}^{{b{\min}}} = \mathop {\min }\limits_{j} \{ y_{pj}^{b} \} ,\quad p = 1,\ldots,s_{2} . \hfill \\ \end{aligned} $$
(15)

The best relative efficiency of IDMU (\(\theta_{I}^{ * }\)) in the presence of undesirable outputs is computed by solving the following model:

$$ \begin{aligned} & \theta_{I}^{ * } = {\max}\frac{{\sum\nolimits_{r = 1}^{{s_{1} }} {u_{r}^{g} y_{r}^{{g{\max}}} - } \sum\nolimits_{p = 1}^{{s_{2} }} {u_{p}^{b} y_{p}^{{b{\max}}} } }}{{\sum\nolimits_{i = 1}^{m} {v_{i}^{{}} x_{i}^{{\min}} } }} \hfill \\ & {\text{ s}}{\text{.t}}{. }\theta_{j}^{{}} = \frac{{\sum\nolimits_{r = 1}^{{s_{1} }} {u_{r}^{g} y_{rj}^{g} - } \sum\nolimits_{p = 1}^{{s_{2} }} {u_{p}^{b} y_{pj}^{b} } }}{{\sum\nolimits_{i = 1}^{m} {v_{i}^{{}} x_{ij}^{{}} } }} \le 1,\quad j = 1,\ldots,n, \hfill \\ & \sum\limits_{r = 1}^{{s_{1} }} {u_{r}^{g} y_{rj}^{g} - } \sum\limits_{p = 1}^{{s_{2} }} {u_{p}^{b} y_{pj}^{b} } \ge 0,\quad j = 1,\ldots,n \hfill \\ & \sum\limits_{r = 1}^{{s_{1} }} {u_{r}^{g} y_{r}^{{g{\max}}} - } \sum\limits_{p = 1}^{{s_{2} }} {u_{p}^{b} y_{p}^{{b{\max}}} } \ge 0, \hfill \\ & u_{r}^{g} \ge \varepsilon \, \forall r,\quad u_{p}^{b} \ge \varepsilon \, \forall p,\quad v_{i}^{{}} \ge \varepsilon \, \forall i. \hfill \\ \end{aligned} $$
(16)

It should be noted that the second constraint set ensures the non-negativity efficiency of each DMU and the third constrain ensures the non-negativity efficiency of IDMU.

The worst relative efficiency of ADMU (\(\varphi_{N}^{ * }\)) in the presence of undesirable outputs is computed by solving the following model:

$$ \begin{aligned} & \varphi_{N}^{ * } = {\min}\frac{{\sum\nolimits_{r = 1}^{{s_{1} }} {u_{r}^{g} y_{r}^{{g{\min}}} - } \sum\nolimits_{p = 1}^{{s_{2} }} {u_{p}^{b} y_{p}^{{b{\min}}} } }}{{\sum\nolimits_{i = 1}^{m} {v_{i}^{{}} x_{i}^{{\max}} } }} \hfill \\ & {\text{ s}}{\text{.t}}{. }\frac{{\sum\nolimits_{r = 1}^{{s_{1} }} {u_{r}^{g} y_{r}^{{g{\max}}} - } \sum\nolimits_{p = 1}^{{s_{2} }} {u_{p}^{b} y_{p}^{{b{\max}}} } }}{{\sum\nolimits_{i = 1}^{m} {v_{i}^{{}} x_{i}^{{\min}} } }} \ge \theta_{I}^{ * } \hfill \\ & \varphi_{j}^{{}} = \frac{{ \, \sum\nolimits_{r = 1}^{{s_{1} }} {u_{r}^{g} y_{rj}^{g} - } \sum\nolimits_{p = 1}^{{s_{2} }} {u_{p}^{b} y_{pj}^{b} } }}{{\sum\nolimits_{i = 1}^{m} {v_{i}^{{}} x_{ij}^{{}} } }} \le 1,\quad j = 1,\ldots,n, \hfill \\ & \sum\limits_{r = 1}^{{s_{1} }} {u_{r}^{g} y_{rj}^{g} - } \sum\limits_{p = 1}^{{s_{2} }} {u_{p}^{b} y_{pj}^{b} } \ge 0,\quad j = 1,\ldots,n, \hfill \\ & \sum\limits_{r = 1}^{{s_{1} }} {u_{r}^{g} y_{r}^{{g{\min}}} - } \sum\limits_{p = 1}^{{s_{2} }} {u_{p}^{b} y_{p}^{{b{\min}}} } \ge 0, \hfill \\ & u_{r}^{g} \ge \varepsilon \, \forall r,\quad u_{p}^{b} \ge \varepsilon \, \forall p,\quad v_{i}^{{}} \ge \varepsilon \, \forall i. \hfill \\ \end{aligned} $$
(17)

Similarly, the third constraint set ensures the non-negativity efficiency of each DMU and the fourth constrain ensures the non-negativity efficiency of ADMU.

The best relative efficiency of DMUo (\(\theta_{o}^{ * }\)) in the presence of undesirable outputs using the optimum efficiency of IDMU is computed by solving the following model:

$$ \begin{aligned} & \theta_{o}^{ * } = {\max}\frac{{\sum\nolimits_{r = 1}^{{s_{1} }} {u_{r}^{g} y_{ro}^{g} - } \sum\nolimits_{p = 1}^{{s_{2} }} {u_{p}^{b} y_{po}^{b} } }}{{\sum\nolimits_{i = 1}^{m} {v_{i}^{{}} x_{io}^{{}} } }} \hfill \\ & {\text{ s}}{\text{.t}}{. }\frac{{\sum\nolimits_{r = 1}^{{s_{1} }} {u_{r}^{g} y_{r}^{{g{\max}}} - } \sum\nolimits_{p = 1}^{{s_{2} }} {u_{p}^{b} y_{p}^{{b{\max}}} } }}{{\sum\nolimits_{i = 1}^{m} {v_{i}^{{}} x_{i}^{{\min}} } }} = \theta_{I}^{ * } \hfill \\ & \theta_{j}^{{}} = \frac{{\sum\nolimits_{r = 1}^{{s_{1} }} {u_{r}^{g} y_{rj}^{g} - } \sum\nolimits_{p = 1}^{{s_{2} }} {u_{p}^{b} y_{pj}^{b} } }}{{\sum\nolimits_{i = 1}^{m} {v_{i}^{{}} x_{ij}^{{}} } }} \le 1, \quad j = 1,\ldots,n, \hfill \\ & \sum\limits_{r = 1}^{{s_{1} }} {u_{r}^{g} y_{rj}^{g} - } \sum\limits_{p = 1}^{{s_{2} }} {u_{p}^{b} y_{pj}^{b} } \ge 0, \quad j = 1,\ldots,n, \, \hfill \\ & u_{r}^{g} \ge \varepsilon \, \forall r,\quad u_{p}^{b} \ge \varepsilon \, \forall p,\quad v_{i}^{{}} \ge \varepsilon \, \forall i. \hfill \\ \end{aligned} $$
(18)

The worst relative efficiency of DMUo (\(\varphi_{o}^{ * }\)) in the presence of undesirable outputs using the optimum efficiency of ADMU is computed by solving the following model:

$$ \begin{aligned} & \varphi_{o}^{ * } = {\rm min} \, \frac{{\sum\nolimits_{r = 1}^{{s_{1} }} {u_{r}^{g} y_{ro}^{g} - } \sum\nolimits_{p = 1}^{{s_{2} }} {u_{p}^{b} y_{po}^{b} } }}{{\sum\nolimits_{i = 1}^{m} {v_{i}^{{}} x_{io}^{{}} } }} \hfill \\ & {{\rm s.t.}} \, \frac{{\sum\nolimits_{r = 1}^{{s_{1} }} {u_{r}^{g} y_{r}^{g{\rm min}} - } \sum\nolimits_{p = 1}^{{s_{2} }} {u_{p}^{b} y_{p}^{b{\rm min}} } }}{{\sum\nolimits_{i = 1}^{m} {v_{i}^{{}} x_{i}^{\rm max} } }} = \varphi_{N}^{ * } \hfill \\ & \varphi_{j}^{{}} = \frac{{ \, \sum\nolimits_{r = 1}^{{s_{1} }} {u_{r}^{g} y_{rj}^{g} - } \sum\nolimits_{p = 1}^{{s_{2} }} {u_{p}^{b} y_{pj}^{b} } }}{{\sum\nolimits_{i = 1}^{m} {v_{i}^{{}} x_{ij}^{{}} } }} \le 1, \quad j = 1,\ldots,n \hfill \\ & \sum\limits_{r = 1}^{{s_{1} }} {u_{r}^{g} y_{rj}^{g} - } \sum\limits_{p = 1}^{{s_{2} }} {u_{p}^{b} y_{pj}^{b} } \ge 0, \quad j = 1,\ldots,n \hfill \\ & u_{r}^{g} \ge \varepsilon \, \forall r , \quad u_{p}^{b} \ge \varepsilon \, \forall p , \quad v_{i}^{{}} \ge \varepsilon \, \forall i. \hfill \\ \end{aligned} $$
(19)

By using Charnes–Cooper transformation, the model (16) is transformed into the following linear programming problem:

$$ \begin{aligned} & \theta_{I}^{ * } = {\rm max} \, \sum\limits_{r = 1}^{{s_{1} }} {u_{r}^{g} y_{r}^{g{\rm max}} - } \sum\limits_{p = 1}^{{s_{2} }} {u_{p}^{b} y_{p}^{b{\rm max}} } \hfill \\ & {\rm s.t.} \, \sum\limits_{i = 1}^{m} {v_{i}^{{}} x_{i}^{\rm min} } = 1 \, \hfill \\ & \sum\limits_{r = 1}^{{s_{1} }} {u_{r}^{g} y_{rj}^{g} - } \sum\limits_{p = 1}^{{s_{2} }} {u_{p}^{b} y_{pj}^{b} } - \sum\limits_{i = 1}^{m} {v_{i}^{{}} x_{ij}^{{}} } \le 0, \, j = 1,\ldots,n, \hfill \\ & \sum\limits_{r = 1}^{{s_{1} }} {u_{r}^{g} y_{rj}^{g} - } \sum\limits_{p = 1}^{{s_{2} }} {u_{p}^{b} y_{pj}^{b} } \ge 0, \quad j = 1,\ldots,n, \hfill \\ & \sum\limits_{r = 1}^{{s_{1} }} {u_{r}^{g} y_{r}^{g{\rm max}} - } \sum\limits_{p = 1}^{{s_{2} }} {u_{p}^{b} y_{p}^{b{\rm max}} } \ge 0, \hfill \\ & u_{r}^{g} \ge \varepsilon \, \forall r , \quad u_{p}^{b} \ge \varepsilon \, \forall p , \quad v_{i}^{{}} \ge \varepsilon \, \forall i. \hfill \\ \end{aligned} $$
(20)

Similarly, the model (17) is transformed into the following linear programming problem:

$$ \begin{aligned} & \varphi_{N}^{ * } = {\rm min} \, \sum\limits_{r = 1}^{{s_{1} }} {u_{r}^{g} y_{r}^{g{\rm min}} - } \sum\limits_{p = 1}^{{s_{2} }} {u_{p}^{b} y_{p}^{b{\rm min}} } \hfill \\ & {\text{ s}}.t. \, \sum\limits_{i = 1}^{m} {v_{i}^{{}} x_{i}^{\rm max} } = 1 \hfill \\ & \sum\limits_{r = 1}^{{s_{1} }} {u_{r}^{g} y_{r}^{g{\rm max}} - } \sum\limits_{p = 1}^{{s_{2} }} {u_{p}^{b} y_{p}^{b{\rm max}} } - \theta_{I}^{ * } \sum\limits_{i = 1}^{m} {v_{i}^{{}} x_{i}^{\rm min} } \ge 0 \hfill \\ & \sum\limits_{r = 1}^{{s_{1} }} {u_{r}^{g} y_{rj}^{g} - } \sum\limits_{p = 1}^{{s_{2} }} {u_{p}^{b} y_{pj}^{b} - \sum\limits_{i = 1}^{m} {v_{i}^{{}} x_{ij}^{{}} } } \le 0, \quad j = 1,\ldots,n, \hfill \\ & \sum\limits_{r = 1}^{{s_{1} }} {u_{r}^{g} y_{rj}^{g} - } \sum\limits_{p = 1}^{{s_{2} }} {u_{p}^{b} y_{pj}^{b} } \ge 0, \quad \,\,\,\,\,\,\,\,\,\,\,\,\,\, \, j = 1,\ldots,n, \hfill \\ & \sum\limits_{r = 1}^{{s_{1} }} {u_{r}^{g} y_{r}^{g{\rm min}} - } \sum\limits_{p = 1}^{{s_{2} }} {u_{p}^{b} y_{p}^{b{\rm min}} } \ge 0, \hfill \\ & u_{r}^{g} \ge \varepsilon \, \forall r , \quad u_{p}^{b} \ge \varepsilon \, \forall p , \quad v_{i}^{{}} \ge \varepsilon \, \forall i. \hfill \\ \end{aligned} $$
(21)

In a similar way, the fractional programming models (18) and (19) are transformed into equivalent linear programming models.

Remark 2

It is required to point out that according to the proposed approach to deal with undesirable outputs, negative weights are taken for undesirable outputs. Thus, models (16) and (18) confirm that the IDMU consumes the minimal amount of inputs and produces the maximum amount of desirable outputs and the minimal amount of undesirable outputs. In a similar way, models (17) and (19) confirm that the ADMU consumes the maximum amount of inputs and produces the minimum amount of desirable inputs and the maximum amount of undesirable outputs.

New fuzzy DEA models

In this subsection, the proposed DEA model with IDMU and ADMU in the presence of undesirable outputs is extended to a fuzzy environment.

Let us assume all fuzzy inputs and outputs are triangular fuzzy numbers. Thus, fuzzy inputs \(\tilde{x}_{ij} \, (i = 1,\ldots,m)\), fuzzy desirable outputs \(\tilde{y}_{rj}^{g} \, (r = 1,\ldots,s_{1} )\) and fuzzy undesirable outputs \(\tilde{y}_{pj}^{b} \, (p = 1,\ldots,s_{2} )\) are represented by \(\tilde{x}_{ij} { = }(x_{ij}^{L} ,x_{ij}^{M} ,x_{ij}^{U} )\), \(\tilde{y}_{rj}^{g} = (y_{rj}^{Lg} ,y_{rj}^{Mg} ,y_{rj}^{Ug} )\) and \(\tilde{y}_{pj}^{b} = (y_{pj}^{Lb} ,y_{pj}^{Mb} ,y_{pj}^{Ub} )\), respectively. The fuzzy efficiency of DMUj is defined as follows:

$$ \tilde{\theta }_{j}^{{}} = \frac{{\sum\nolimits_{r = 1}^{{s_{1} }} {u_{r}^{g} \tilde{y}_{rj}^{g} - } \sum\nolimits_{p = 1}^{{s_{2} }} {u_{p}^{b} \tilde{y}_{pj}^{b} } }}{{\sum\nolimits_{i = 1}^{m} {v_{i}^{{}} \tilde{x}_{ij}^{{}} } }}. $$
(22)

The fuzzy inputs and fuzzy desirable and undesirable outputs of fuzzy IDMU, i.e., \({\text{FIDMU}} = (\tilde{X}^{\rm min} ,\tilde{Y}^{g{\rm max}} ,\tilde{Y}^{b{\rm max}} )\) and fuzzy ADMU, i.e., \({\text{FADMU}} = (\tilde{X}^{\rm max} ,\tilde{Y}^{g{\rm min}} ,\tilde{Y}^{b{\rm min}} )\) are defined as follows:

$$ \begin{aligned} \tilde{x}_{i}^{\rm min} & = (x_{i}^{L{\rm min}} ,x_{i}^{M{\rm min}} ,x_{i}^{U{\rm min}} ) \\ & = \left( {\mathop {\min }\limits_{j} \{ x_{ij}^{L} \} ,\mathop {\min }\limits_{j} \{ x_{ij}^{M} \} ,\mathop {\min }\limits_{j} \{ x_{ij}^{U} \} } \right), \\ i & = 1,\ldots,m,\, \hfill \\ x_{i}^{\rm max} & = (x_{i}^{Lmax} ,x_{i}^{Mmax} ,x_{i}^{Umax} ) \\ & = \left( {\mathop {\max }\limits_{j} \{ x_{ij}^{L} \} ,\mathop {\max }\limits_{j} \{ x_{ij}^{M} \} ,\mathop {\max }\limits_{j} \{ x_{ij}^{U} \} } \right),\\ i &= 1,\ldots,m, \hfill \\ \tilde{y}_{r}^{g{\rm max}} & = (y_{r}^{Lg{\rm max}} ,y_{r}^{Mg{\rm max}} ,y_{r}^{Ug{\rm max}} ) \\ & = \left( {\mathop {\max }\limits_{j} \{ y_{rj}^{Lg} \} ,\mathop {\max }\limits_{j} \{ y_{rj}^{Mg} \} ,\mathop {\max }\limits_{j} \{ y_{rj}^{Ug} \} } \right),\\ r &= 1,\ldots,s_{1} ,\, \hfill \\ \tilde{y}_{r}^{g{\rm min}} & = (y_{r}^{Lg{\rm min}} ,y_{r}^{Mg{\rm min}} ,y_{r}^{Ug{\rm min}} )\\ &= \left( {\mathop {\min }\limits_{j} \{ y_{rj}^{Lg} \} ,\mathop {\min }\limits_{j} \{ y_{rj}^{Mg} \} ,\mathop {\min }\limits_{j} \{ y_{rj}^{Ug} \} } \right), \\ r &= 1,\ldots,s_{1} , \hfill \\ \tilde{y}_{p}^{b{\rm max}} & = (y_{p}^{Lb{\rm max}} ,y_{p}^{Mb{\rm max}} ,y_{p}^{Ub{\rm max}} ) \\ &= \left( {\mathop {\max }\limits_{j} \{ y_{pj}^{Lb} \} ,\mathop {\max }\limits_{j} \{ y_{pj}^{Mb} \} ,\mathop {\max }\limits_{j} \{ y_{pj}^{Ub} \} } \right),\\ p &= 1,\ldots,s_{2} , \hfill \\ \tilde{y}_{p}^{b{\rm min}} & = (y_{p}^{Lb{\rm min}} ,y_{p}^{Mb{\rm min}} ,y_{p}^{Ub{\rm min}} ) \\ &= \left( {\mathop {\min }\limits_{j} \{ y_{pj}^{Lb} \} ,\mathop {\min }\limits_{j} \{ y_{rp}^{Mb} \} ,\mathop {\min }\limits_{j} \{ y_{pj}^{Ub} \} } \right), \\ p &= 1,\ldots,s_{2} . \hfill \\ \end{aligned} $$
(23)

The fuzzy efficiency of FIDMU and FADMU are defined as follows:

$$ \tilde{\theta }_{I}^{{}} = \frac{{\sum\nolimits_{r = 1}^{{s_{1} }} {u_{r}^{g} \tilde{y}_{r}^{g{\rm max}} - } \sum\nolimits_{p = 1}^{{s_{2} }} {u_{p}^{b} \tilde{y}_{p}^{b{\rm max}} } }}{{\sum\nolimits_{i = 1}^{m} {v_{i}^{{}} \tilde{x}_{i}^{\rm min} } }}, $$
(24)
$$ \tilde{\varphi }_{N}^{{}} = \frac{{\sum\nolimits_{r = 1}^{{s_{1} }} {u_{r}^{g} \tilde{y}_{r}^{g{\rm min}} - } \sum\nolimits_{p = 1}^{{s_{2} }} {u_{p}^{b} \tilde{y}_{p}^{b{\rm min}} } }}{{\sum\nolimits_{i = 1}^{m} {v_{i}^{{}} \tilde{x}_{i}^{\rm max} } }}. $$
(25)

The best fuzzy efficiency of FIDMU

Here, we describe a method to fine the best fuzzy efficiency of FIDMU.

The following model can be used to determine the best fuzzy relative efficiency of FIDMU (\(\tilde{\theta }_{I}^{ * }\)):

$$ \begin{aligned} & \tilde{\theta }_{I}^{ * } = {\rm max} \, \frac{{\sum\nolimits_{r = 1}^{{s_{1} }} {u_{r}^{g} \tilde{y}_{r}^{g{\rm max}} - } \sum\nolimits_{p = 1}^{{s_{2} }} {u_{p}^{b} \tilde{y}_{p}^{b{\rm max}} } }}{{\sum\nolimits_{i = 1}^{m} {v_{i}^{{}} \tilde{x}_{i}^{\rm min} } }} \hfill \\ & {\rm s.t.} \, \tilde{\theta }_{j}^{{}} = \frac{{\sum\nolimits_{r = 1}^{{s_{1} }} {u_{r}^{g} \tilde{y}_{rj}^{g} - } \sum\nolimits_{p = 1}^{{s_{2} }} {u_{p}^{b} \tilde{y}_{pj}^{b} } }}{{\sum\nolimits_{i = 1}^{m} {v_{i}^{{}} \tilde{x}_{ij}^{{}} } }} \le 1, \, j = 1,\ldots,n, \hfill \\ &\sum\limits_{r = 1}^{{s_{1} }} {u_{r}^{g} \tilde{y}_{rj}^{g} - } \sum\limits_{p = 1}^{{s_{2} }} {u_{p}^{b} \tilde{y}_{pj}^{b} } \ge 0, \, j = 1,\ldots,n \hfill \\ & \sum\limits_{r = 1}^{{s_{1} }} {u_{r}^{g} \tilde{y}_{r}^{g{\rm max}} - } \sum\limits_{p = 1}^{{s_{2} }} {u_{p}^{b} \tilde{y}_{p}^{b{\rm max}} } \ge 0, \hfill \\ & u_{r}^{g} \ge \varepsilon \, \forall r , \quad u_{p}^{b} \ge \varepsilon \, \forall p , \quad v_{i}^{{}} \ge \varepsilon \, \forall i. \hfill \\ \end{aligned} $$
(26)

Here, we use a modification of the method proposed by Wang et al. [71] for solving the fuzzy model (26) which is based on fuzzy arithmetic operations. By using triangular fuzzy numbers, the fuzzy model (26) is formulated as follows:

$$ \begin{aligned} & \tilde{\theta }_{I}^{ * } = max\tilde{\theta }_{I}^{{}} \, \approx [\theta_{I}^{L} ,\theta_{I}^{M} ,\theta_{I}^{U} ] = \frac{{\sum\nolimits_{r = 1}^{{s_{1} }} {u_{r}^{g} (y_{r}^{Lg{\rm max}} ,y_{r}^{Mg{\rm max}} ,y_{r}^{Ug{\rm max}} ) - } \sum\nolimits_{p = 1}^{{s_{2} }} {u_{p}^{b} (y_{p}^{Lb{\rm max}} ,y_{p}^{Mb{\rm max}} ,y_{p}^{Ub{\rm max}} )} }}{{\sum\nolimits_{i = 1}^{m} {v_{i}^{{}} (x_{i}^{L{\rm min}} ,x_{i}^{M{\rm min}} ,x_{i}^{U{\rm min}} )} }} \hfill \\ & {\rm s.t.} \, \tilde{\theta }_{j}^{{}} = \frac{{\sum\nolimits_{r = 1}^{{s_{1} }} {u_{r}^{g} (y_{rj}^{gL} ,y_{rj}^{gM} ,y_{rj}^{gU} ) - } \sum\nolimits_{p = 1}^{{s_{2} }} {u_{p}^{b} (y_{pj}^{bL} ,y_{pj}^{bM} ,y_{pj}^{bU} )} }}{{\sum\nolimits_{i = 1}^{m} {v_{i}^{{}} (x_{ij}^{L} ,x_{ij}^{M} ,x_{ij}^{U} )} }} \le 1, \, j = 1,\ldots,n, \hfill \\ & \sum\limits_{r = 1}^{{s_{1} }} {u_{r}^{g} (y_{rj}^{gL} ,y_{rj}^{gM} ,y_{rj}^{gU} ) - } \sum\limits_{p = 1}^{{s_{2} }} {u_{p}^{b} (y_{pj}^{bL} ,y_{pj}^{bM} ,y_{pj}^{bU} )} \ge 0, \, j = 1,\ldots,n \hfill \\ & \sum\limits_{r = 1}^{{s_{1} }} {u_{r}^{g} (y_{r}^{Lg{\rm max}} ,y_{r}^{Mg{\rm max}} ,y_{r}^{Ug{\rm max}} ) - } \sum\limits_{p = 1}^{{s_{2} }} {u_{p}^{b} (y_{p}^{Lb{\rm max}} ,y_{p}^{Mb{\rm max}} ,y_{p}^{Ub{\rm max}} )} \ge 0, \hfill \\ & u_{r}^{g} \ge \varepsilon \, \forall r , \quad u_{p}^{b} \ge \varepsilon \, \forall p , \quad v_{i}^{{}} \ge \varepsilon \, \forall i. \hfill \\ \end{aligned} $$
(27)

According to fuzzy arithmetic, the fuzzy model (27) is rewritten as follows:

$$ \begin{aligned} & \tilde{\theta }_{I}^{ * } = max\tilde{\theta }_{I}^{{}} \, \approx [\theta_{I}^{L} ,\theta_{I}^{M} ,\theta_{I}^{U} ] \hfill \\ & =\left[ {\frac{{\sum\nolimits_{r = 1}^{{s_{1} }} {u_{r}^{g} y_{r}^{Lg{\rm max}} } - \sum\nolimits_{p = 1}^{{s_{2} }} {u_{p}^{b} y_{p}^{Ub{\rm max}} } }}{{\sum\nolimits_{i = 1}^{m} {v_{i}^{{}} x_{i}^{U{\rm min}} } }},\frac{{\sum\nolimits_{r = 1}^{{s_{1} }} {u_{r}^{g} y_{r}^{Mg{\rm max}} } - \sum\nolimits_{p = 1}^{{s_{2} }} {u_{p}^{b} y_{p}^{Mb{\rm max}} } }}{{\sum\nolimits_{i = 1}^{m} {v_{i}^{{}} x_{i}^{M{\rm min}} } }},\frac{{\sum\nolimits_{r = 1}^{{s_{1} }} {u_{r}^{g} y_{r}^{Ug{\rm max}} } - \sum\nolimits_{p = 1}^{{s_{2} }} {u_{p}^{b} y_{p}^{Lb{\rm max}} } }}{{\sum\nolimits_{i = 1}^{m} {v_{i}^{{}} x_{i}^{M{\rm min}} } }}} \right] \hfill \\ & {\rm s.t.} \, \tilde{\theta }_{j} = [\theta_{j}^{L} ,\theta_{j}^{M} ,\theta_{j}^{U} ] \hfill \\ &= \left[ {\frac{{\sum\nolimits_{r = 1}^{{s_{1} }} {u_{r}^{g} y_{rj}^{Lg} - } \sum\nolimits_{p = 1}^{{s_{2} }} {u_{p}^{b} y_{pj}^{Ub} } }}{{\sum\nolimits_{i = 1}^{m} {v_{i}^{{}} x_{ij}^{U} } }},\frac{{\sum\nolimits_{r = 1}^{{s_{1} }} {u_{r}^{g} y_{rj}^{Mg} - } \sum\nolimits_{p = 1}^{{s_{2} }} {u_{p}^{b} y_{pj}^{Mb} } }}{{\sum\nolimits_{i = 1}^{m} {v_{i}^{{}} x_{ij}^{M} } }},\frac{{\sum\nolimits_{r = 1}^{{s_{1} }} {u_{r}^{g} y_{rj}^{Ug} - } \sum\nolimits_{p = 1}^{{s_{2} }} {u_{p}^{b} y_{pj}^{Lb} } }}{{\sum\nolimits_{i = 1}^{m} {v_{i}^{{}} x_{ij}^{L} } }}} \right] \le 1, \, \,\,\,\,\,\,\,\, \, j = 1,\ldots,n, \hfill \\ &\left[ {\sum\limits_{r = 1}^{{s_{1} }} {u_{r}^{g} y_{rj}^{Lg} - } \sum\limits_{p = 1}^{{s_{2} }} {u_{p}^{b} y_{pj}^{Ub} } ,\sum\limits_{r = 1}^{{s_{1} }} {u_{r}^{g} y_{rj}^{Mg} - } \sum\limits_{p = 1}^{{s_{2} }} {u_{p}^{b} y_{pj}^{Mb} } ,\sum\limits_{r = 1}^{{s_{1} }} {u_{r}^{g} y_{rj}^{Ug} - } \sum\limits_{p = 1}^{{s_{2} }} {u_{p}^{b} y_{pj}^{Lb} } } \right] \ge 0, \, j = 1,\ldots,n, \hfill \\ & \left[ {\sum\limits_{r = 1}^{{s_{1} }} {u_{r}^{g} y_{r}^{Lg{\rm max}} } - \sum\limits_{p = 1}^{{s_{2} }} {u_{p}^{b} y_{p}^{Ub{\rm max}} } ,\sum\limits_{r = 1}^{{s_{1} }} {u_{r}^{g} y_{r}^{Mg{\rm max}} } - \sum\limits_{p = 1}^{{s_{2} }} {u_{p}^{b} y_{p}^{Mb{\rm max}} ,\sum\limits_{r = 1}^{{s_{1} }} {u_{r}^{g} y_{r}^{Ug{\rm max}} } - \sum\limits_{p = 1}^{{s_{2} }} {u_{p}^{b} y_{p}^{Lb{\rm max}} } } } \right] \ge 0, \hfill \\ & u_{r}^{g} \ge \varepsilon \, \forall r , \quad u_{p}^{b} \ge \varepsilon \, \forall p , \quad v_{i}^{{}} \ge \varepsilon \, \forall i. \hfill \\ \end{aligned} $$
(28)

In the model (28), as long as upper bound \(\theta_{I}^{U}\) is kept to be less than or equal to one, \(\theta_{I}^{M}\) and \(\theta_{I}^{L}\) will be spontaneously satisfied. Similarly, as long as lower bound \(\sum\nolimits_{r = 1}^{{s_{1} }} {u_{r}^{g} y_{rj}^{Lg} - } \sum\nolimits_{p = 1}^{{s_{2} }} {u_{p}^{b} y_{pj}^{Ub} }\) is kept to be more than or equal to zero, then \(\sum\nolimits_{r = 1}^{{s_{1} }} {u_{r}^{g} y_{rj}^{Mg} - } \sum\nolimits_{p = 1}^{{s_{2} }} {u_{p}^{b} y_{pj}^{Mb} }\) and \(\sum\nolimits_{r = 1}^{{s_{1} }} {u_{r}^{g} y_{rj}^{Ug} - } \sum\nolimits_{p = 1}^{{s_{2} }} {u_{p}^{b} y_{pj}^{Lb} }\) will be spontaneously satisfied. Moreover, as long as lower bound \(\sum\nolimits_{r = 1}^{{s_{1} }} {u_{r}^{g} y_{r}^{Lg{\rm max}} } - \sum\nolimits_{p = 1}^{{s_{2} }} {u_{p}^{b} y_{p}^{Ub{\rm max}} }\) is kept to be more than or equal to zero, \(\sum\nolimits_{r = 1}^{{s_{1} }} {u_{r}^{g} y_{r}^{Mg{\rm max}} } - \sum\nolimits_{p = 1}^{{s_{2} }} {u_{p}^{b} y_{p}^{Mb{\rm max}} }\) and \(\sum\nolimits_{r = 1}^{{s_{1} }} {u_{r}^{g} y_{r}^{Ug{\rm max}} } - \sum\nolimits_{p = 1}^{{s_{2} }} {u_{p}^{b} y_{p}^{Lb{\rm max}} }\) will be spontaneously satisfied. Therefore, the model (28) is simplified as follows:

$$ \begin{aligned} & \tilde{\theta }_{I}^{ * } = {\rm max}\,\tilde{\theta }_{I}^{{}} \, \approx [\theta_{I}^{L} ,\theta_{I}^{M} ,\theta_{I}^{U} ] \hfill \\ &= \left[ {\frac{{\sum\nolimits_{r = 1}^{{s_{1} }} {u_{r}^{g} y_{r}^{Lg{\rm max}} } - \sum\nolimits_{p = 1}^{{s_{2} }} {u_{p}^{b} y_{p}^{Ub{\rm max}} } }}{{\sum\nolimits_{i = 1}^{m} {v_{i}^{{}} x_{i}^{U{\rm min}} } }},\frac{{\sum\nolimits_{r = 1}^{{s_{1} }} {u_{r}^{g} y_{r}^{Mg{\rm max}} } - \sum\nolimits_{p = 1}^{{s_{2} }} {u_{p}^{b} y_{p}^{Mb{\rm max}} } }}{{\sum\nolimits_{i = 1}^{m} {v_{i}^{{}} x_{i}^{M{\rm min}} } }},\frac{{\sum\nolimits_{r = 1}^{{s_{1} }} {u_{r}^{g} y_{r}^{Ug{\rm max}} } - \sum\nolimits_{p = 1}^{{s_{2} }} {u_{p}^{b} y_{p}^{Lb{\rm max}} } }}{{\sum\nolimits_{i = 1}^{m} {v_{i}^{{}} x_{i}^{L{\rm min}} } }}} \right] \hfill \\ & {\rm s.t.} \, \frac{{\sum\nolimits_{r = 1}^{{s_{1} }} {u_{r}^{g} y_{rj}^{Ug} - } \sum\nolimits_{p = 1}^{{s_{2} }} {u_{p}^{b} y_{pj}^{Lb} } }}{{\sum\nolimits_{i = 1}^{m} {v_{i}^{{}} x_{ij}^{L} } }} \le 1, \, \,\,\,\,\,\,\,\, \, j = 1,\ldots,n, \hfill \\ & \,\sum\limits_{r = 1}^{{s_{1} }} {u_{r}^{g} y_{rj}^{Lg} - } \sum\limits_{p = 1}^{{s_{2} }} {u_{p}^{b} y_{pj}^{Ub} } \ge 0, \, j = 1,\ldots,n, \hfill \\ & \sum\limits_{r = 1}^{{s_{1} }} {u_{r}^{g} y_{r}^{Lg{\rm max}} } - \sum\limits_{p = 1}^{{s_{2} }} {u_{p}^{b} y_{p}^{Ub{\rm max}} } \ge 0, \hfill \\ & u_{r}^{g} \ge \varepsilon \, \forall r , \quad u_{p}^{b} \ge \varepsilon \, \forall p , \quad v_{i}^{{}} \ge \varepsilon \, \forall i. \hfill \\ \end{aligned} $$
(29)

Note that model (29) is still a fuzzy model with one fuzzy variable in the objective function. We propose a new method to solve model (29) using the conversion of this model into a multi-objective linear programming (MOLP) problem. Thus, maximizing the fuzzy efficiency \(\tilde{\theta }_{I}^{{}}\), which has three components \([\theta_{I}^{L} ,\theta_{I}^{M} ,\theta_{I}^{U} ]\), leads to the following MOLP model with three objective functions for maximizing these three variables simultaneously:

$$ \begin{aligned} & \theta_{I}^{ * L} = \max \,\theta_{I}^{L} = \frac{{\sum\nolimits_{r = 1}^{{s_{1} }} {u_{r}^{g} y_{r}^{Lg{\rm max}} } - \sum\nolimits_{p = 1}^{{s_{2} }} {u_{p}^{b} y_{p}^{Ub{\rm max}} } }}{{\sum\nolimits_{i = 1}^{m} {v_{i}^{{}} x_{i}^{U{\rm min}} } }} \hfill \\ & \theta_{I}^{ * M} = \max \,\theta_{I}^{M} = \frac{{\sum\nolimits_{r = 1}^{{s_{1} }} {u_{r}^{g} y_{r}^{Mg{\rm max}} } - \sum\nolimits_{p = 1}^{{s_{2} }} {u_{p}^{b} y_{p}^{Mb{\rm max}} } }}{{\sum\nolimits_{i = 1}^{m} {v_{i}^{{}} x_{i}^{M{\rm min}} } }} \hfill \\ & \theta_{I}^{ * U} = \max \,\theta_{I}^{U} = \frac{{\sum\nolimits_{r = 1}^{{s_{1} }} {u_{r}^{g} y_{r}^{Ug{\rm max}} } - \sum\nolimits_{p = 1}^{{s_{2} }} {u_{p}^{b} y_{p}^{Lb{\rm max}} } }}{{\sum\nolimits_{i = 1}^{m} {v_{i}^{{}} x_{i}^{L{\rm min}} } }} \hfill \\ & {\rm s.t.}{\text{ Constraints}}\,{\text{of}}\,{\text{model}}\,\,{(29)}{\text{.}} \hfill \\ \end{aligned} $$
(30)

Now, to find the fuzzy relative efficiency of FIDMU, we use a lexicographic approach for solving MOLP model (30). Therefore, the following model is solved at first:

$$ \begin{aligned} & \theta_{I}^{ * L} = \max \,\theta_{I}^{L} = \frac{{\sum\nolimits_{r = 1}^{{s_{1} }} {u_{r}^{g} y_{r}^{Lg{\rm max}} } - \sum\nolimits_{p = 1}^{{s_{2} }} {u_{p}^{b} y_{p}^{Ub{\rm max}} } }}{{\sum\nolimits_{i = 1}^{m} {v_{i}^{{}} x_{i}^{U{\rm min}} } }} \hfill \\ & {\rm s.t.}{\text{ Constraints}}\,{\text{of}}\,{\text{model}}\,{(29)}{\text{.}} \hfill \\ \end{aligned} $$
(31)

By using Charnes–Cooper transformation, the model (31) can be transformed into a linear programming problem.

The second step in the lexicographic optimization of model (30) consists in solving the following model:

$$ \begin{aligned} & \theta_{I}^{ * M} = \max \,\theta_{I}^{M} = \frac{{\sum\nolimits_{r = 1}^{{s_{1} }} {u_{r}^{g} y_{r}^{Mg{\rm max}} } - \sum\nolimits_{p = 1}^{{s_{2} }} {u_{p}^{b} y_{p}^{Mb{\rm max}} } }}{{\sum\nolimits_{i = 1}^{m} {v_{i}^{{}} x_{i}^{M{\rm min}} } }} \hfill \\ & {\rm s.t.} \, \,\,\,\theta_{I}^{L} { = }\theta_{I}^{ * L} , \, \hfill \\ & {\text{Constraints}}\,{\text{of}}\,{\text{model}}\,{(29)}{\text{.}} \hfill \\ \end{aligned} $$
(32)

Clearly, the constraint \(\sum\nolimits_{r = 1}^{{s_{1} }} {u_{r}^{g} y_{r}^{Lg{\rm max}} } - \sum\nolimits_{p = 1}^{{s_{2} }} {u_{p}^{b} y_{p}^{Ub{\rm max}} } \ge 0\) of model (29) will be redundant for model (32) and can be removed. Similarly, by using Charnes–Cooper transformation, the model (32) can be transformed into a linear programming problem.

The third step in the lexicographic optimization of model (30) consists in solving the following model:

$$ \begin{aligned} & \theta_{I}^{ * U} = \max \,\theta_{I}^{U} = \frac{{\sum\nolimits_{r = 1}^{{s_{1} }} {u_{r}^{g} y_{r}^{Lg{\rm max}} } - \sum\nolimits_{p = 1}^{{s_{2} }} {u_{p}^{b} y_{p}^{Ub{\rm max}} } }}{{\sum\nolimits_{i = 1}^{m} {v_{i}^{{}} x_{i}^{L{\rm min}} } }} \hfill \\ {\rm s.t.} \, \,\,\theta_{I}^{M} { = }\theta_{I}^{ * M} \hfill \ & \theta_{I}^{L} { = }\theta_{I}^{ * L} , \, \hfill \\ &{\text{Constraints}}\,{\text{of}}\,{\text{model}}\,{(29)}{\text{.}} \hfill \\ \end{aligned} $$
(33)

The model (33) can be transformed into a linear programming problem by using Charnes–Cooper transformation.

The optimal values of models (31)–(33) give the fuzzy efficiency of FIDMU as \(\tilde{\theta }_{I}^{ * } \approx [\theta_{I}^{*L} ,\theta_{I}^{*M} ,\theta_{I}^{*U} ]\).

It must be pointed out that the main reason to use the lexicographic approach for model (30) is to find the optimal solution of model (29). When we solve the problem of each objective function of model (30) with the constraint conditions, separately, the obtained optimal solutions of the resulting problems may or may not provide the optimal solution of model (29). In such a case, the following three separate problems are solved:

$$ \begin{aligned} &\theta_{I}^{ * L} = \max \,\theta_{I}^{L} = \frac{{\sum\nolimits_{r = 1}^{{s_{1} }} {u_{r}^{g} y_{r}^{Lg{\rm max}} } - \sum\nolimits_{p = 1}^{{s_{2} }} {u_{p}^{b} y_{p}^{Ub{\rm max}} } }}{{\sum\nolimits_{i = 1}^{m} {v_{i}^{{}} x_{i}^{U{\rm min}} } }}\quad \quad \quad \quad ({\text{A}}) \hfill \\ \hfill \\ &{\rm s.t.}{\text{ Constraints}}\,{\text{of}}\,{\text{model}}\,\,{(29)}{\text{.}} \hfill \\ \end{aligned} $$
$$ \begin{aligned} &\theta_{I}^{ * M} = \max \,\theta_{I}^{M} = \frac{{\sum\nolimits_{r = 1}^{{s_{1} }} {u_{r}^{g} y_{r}^{Mg{\rm max}} } - \sum\nolimits_{p = 1}^{{s_{2} }} {u_{p}^{b} y_{p}^{Mb{\rm max}} } }}{{\sum\nolimits_{i = 1}^{m} {v_{i}^{{}} x_{i}^{M{\rm min}} } }}\quad \quad \quad ({\text{B}}) \hfill \\ & {\rm s.t.}{\text{ Constraints}}\,{\text{of}}\,{\text{model}}\,\,{(29)}{\text{.}} \hfill \\ \end{aligned} $$
$$ \begin{aligned} & \theta_{I}^{ * U} = \max \,\theta_{I}^{U} = \frac{{\sum\nolimits_{r = 1}^{{s_{1} }} {u_{r}^{g} y_{r}^{Ug{\rm max}} } - \sum\nolimits_{p = 1}^{{s_{2} }} {u_{r}^{b} y_{p}^{Lb{\rm max}} } }}{{\sum\nolimits_{i = 1}^{m} {v_{i}^{{}} x_{i}^{L{\rm min}} } }}\quad \quad \quad \quad ({\text{C}}) \hfill \\ &{\rm s.t.}{\text{ Constraints}}\,{\text{of}}\,{\text{model}}\,\,{(29)}{\text{.}} \hfill \\ \end{aligned} $$

It is obvious that solving problems (A), (B) and (C) may provide different optimal solution \(\left( {v_{i}^{*} ,u_{r}^{*g} ,u_{r}^{*b} } \right)\). Assume that \(\left( {v_{i}^{*A} ,u_{r}^{*gA} ,u_{r}^{*bA} } \right)\), \(\left( {v_{i}^{*B} ,u_{r}^{*gB} ,u_{r}^{*bB} } \right)\) and \(\left( {v_{i}^{*C} ,u_{r}^{*gC} ,u_{r}^{*bC} } \right)\) are the optimal solutions of problems (A), (B) and (C), respectively. First, there is no criterion to choose one of these optimal solutions as the optimal solution of model (29). Second, the optimal values of these problems are as follows:

$$ \theta_{I}^{ * L} = \max \,\theta_{I}^{L} = \frac{{\sum\nolimits_{r = 1}^{{s_{1} }} {u_{r}^{*gA} y_{r}^{Lg{\rm max}} } - \sum\nolimits_{p = 1}^{{s_{2} }} {u_{p}^{*bA} y_{p}^{Ub{\rm max}} } }}{{\sum\nolimits_{i = 1}^{m} {v_{i}^{*A} x_{i}^{U{\rm min}} } }}, $$
$$ \begin{aligned} \theta_{I}^{ * M} &= \max \,\theta_{I}^{M} \\ & = \frac{{\sum\nolimits_{r = 1}^{{s_{1} }} {u_{r}^{*gB} y_{r}^{Mg{\rm max}} } - \sum\nolimits_{p = 1}^{{s_{2} }} {u_{p}^{*bB} y_{p}^{Mb{\rm max}} } }}{{\sum\nolimits_{i = 1}^{m} {v_{i}^{*B} x_{i}^{M{\rm min}} } }}, \end{aligned}$$
$$ \theta_{I}^{ * U} = \max \,\theta_{I}^{U} = \frac{{\sum\nolimits_{r = 1}^{{s_{1} }} {u_{r}^{*gC} y_{r}^{Ug{\rm max}} } - \sum\nolimits_{p = 1}^{{s_{2} }} {u_{r}^{*bC} y_{p}^{Lb{\rm max}} } }}{{\sum\nolimits_{i = 1}^{m} {v_{i}^{*C} x_{i}^{L{\rm min}} } }} $$

Since the values of \(\theta_{I}^{ * L}\), \(\theta_{I}^{ * M}\) and \(\theta_{I}^{ * U}\) are obtained by solving three independent crisp DEA models so the restriction \(\theta_{I}^{ * L} \le \theta_{I}^{ * M} \le \theta_{I}^{ * U}\) may or may not be satisfied. Hence, \(\tilde{\theta }_{I}^{ * } = \left( {\theta_{I}^{ * L} ,\theta_{I}^{ * M} ,\theta_{I}^{ * U} } \right)\) may or may not preserve the form of a triangular fuzzy number. However, it is obvious that the proposed lexicographic approach overcome these limitations.

The worst fuzzy efficiency of FADMU

Here, we describe a method to find the worst fuzzy efficiency of FADMU.

Similarly, the following MOLP problem is constructed to determine the worst fuzzy efficiency of FADMU:

$$ \begin{aligned} &\tilde{\varphi }_{N}^{ * } = \min \,\tilde{\varphi }_{N}^{{}} \, \approx [\varphi_{N}^{L} ,\varphi_{N}^{M} ,\varphi_{N}^{U} ] \\ &=\left[ \frac{{\sum\nolimits_{r = 1}^{{s_{1} }} {u_{r}^{g} y_{r}^{Lg{\rm min}} } - \sum\nolimits_{p = 1}^{{s_{2} }} {u_{p}^{b} y_{p}^{Ub{\rm min}} } }}{{\sum\nolimits_{i = 1}^{m} {v_{i}^{{}} x_{i}^{Umax} } }},\right.\\ &\left.\frac{{\sum\nolimits_{r = 1}^{{s_{1} }} {u_{r}^{g} y_{r}^{Mg{\rm min}} } - \sum\nolimits_{p = 1}^{{s_{2} }} {u_{p}^{b} y_{p}^{Mb{\rm min}} } }}{{\sum\nolimits_{i = 1}^{m} {v_{i}^{{}} x_{i}^{Mmax} } }},\right.\\ &\left.\frac{{\sum\nolimits_{r = 1}^{{s_{1} }} {u_{r}^{g} y_{r}^{Ug{\rm min}} } - \sum\nolimits_{p = 1}^{{s_{2} }} {u_{p}^{b} y_{p}^{Lb{\rm min}} } }}{{\sum\nolimits_{i = 1}^{m} {v_{i}^{{}} x_{i}^{Lmax} } }} \right] \, \\ &{\text{ s.t.}} \, \frac{{\sum\nolimits_{r = 1}^{{s_{1} }} {u_{r}^{g} y_{r}^{Lg{\rm max}} - } \sum\nolimits_{p = 1}^{{s_{2} }} {u_{p}^{b} y_{p}^{Ub{\rm max}} } }}{{\sum\nolimits_{i = 1}^{m} {v_{i}^{{}} x_{i}^{U{\rm min}} } }} \ge \theta_{I}^{ * L} , \\ & \frac{{\sum\nolimits_{r = 1}^{{s_{1} }} {u_{r}^{g} y_{r}^{Mg{\rm max}} - } \sum\nolimits_{p = 1}^{{s_{2} }} {u_{p}^{b} y_{p}^{Mb{\rm max}} } }}{{\sum\nolimits_{i = 1}^{m} {v_{i}^{{}} x_{i}^{M{\rm min}} } }} \ge \theta_{I}^{ * M} , \\ & \frac{{\sum\nolimits_{r = 1}^{{s_{1} }} {u_{r}^{g} y_{r}^{Ug{\rm max}} - } \sum\nolimits_{p = 1}^{{s_{2} }} {u_{p}^{b} y_{p}^{Lb{\rm max}} } }}{{\sum\nolimits_{i = 1}^{m} {v_{i}^{{}} x_{i}^{L{\rm min}} } }} \ge \theta_{I}^{ * U} , \\ & \frac{{ \, \sum\nolimits_{r = 1}^{{s_{1} }} {u_{r}^{g} y_{rj}^{Ug} - } \sum\nolimits_{p = 1}^{{s_{2} }} {u_{p}^{b} y_{pj}^{Lb} } }}{{\sum\nolimits_{i = 1}^{m} {v_{i}^{{}} x_{ij}^{L} } }} \le 1, \, \,\,\,\,\,\, \, j = 1,\ldots,n, \\ & \sum\limits_{r = 1}^{{s_{1} }} {u_{r}^{g} y_{rj}^{Lg} - } \sum\limits_{p = 1}^{{s_{2} }} {u_{p}^{b} y_{pj}^{Ub} } \ge 0, \, j = 1,\ldots,n, \\ & \sum\limits_{r = 1}^{{s_{1} }} {u_{r}^{g} y_{r}^{Lg{\rm min}} - } \sum\limits_{p = 1}^{{s_{2} }} {u_{p}^{b} y_{p}^{Ub{\rm min}} } \ge 0, \\ & u_{r}^{g} \ge \varepsilon \, \forall r , \quad u_{p}^{b} \ge \varepsilon \, \forall p , \quad v_{i}^{{}} \ge \varepsilon \, \forall i. \\ \end{aligned} $$
(34)

Note that model (34) is still a fuzzy model with fuzzy coefficients in the objective function which can be formulated as the following MOLP problem:

$$ \begin{aligned} &\varphi_{N}^{ * L} = \min \,\varphi_{N}^{L} = \frac{{\sum\nolimits_{r = 1}^{{s_{1} }} {u_{r}^{g} y_{r}^{Lg{\rm min}} } - \sum\nolimits_{p = 1}^{{s_{2} }} {u_{p}^{b} y_{p}^{Ub{\rm min}} } }}{{\sum\nolimits_{i = 1}^{m} {v_{i}^{{}} x_{i}^{Umax} } }} \hfill \\ &\varphi_{N}^{ * M} = \min \,\varphi_{N}^{M} = \frac{{\sum\nolimits_{r = 1}^{{s_{1} }} {u_{r}^{g} y_{r}^{Mg{\rm min}} } - \sum\nolimits_{p = 1}^{{s_{2} }} {u_{p}^{b} y_{p}^{Mb{\rm min}} } }}{{\sum\nolimits_{i = 1}^{m} {v_{i}^{{}} x_{i}^{Mmax} } }} \hfill \\ &\varphi_{N}^{ * U} = \min \,\varphi_{N}^{U} = \frac{{\sum\nolimits_{r = 1}^{{s_{1} }} {u_{r}^{g} y_{r}^{Ug{\rm min}} } - \sum\nolimits_{p = 1}^{{s_{2} }} {u_{p}^{b} y_{p}^{Lb{\rm min}} } }}{{\sum\nolimits_{i = 1}^{m} {v_{i}^{{}} x_{i}^{Lmax} } }} \hfill \\ &{\text{s.t.}} \, {\text{ Constraints of}}\,{\text{model}}\,{(34)}{\text{.}} \hfill \\ \end{aligned} $$
(35)

According to the lexicographic approach for solving MOLP model (35), the following model is solved at first:

$$ \begin{aligned} &\varphi_{N}^{ * L} = \min \,\varphi_{N}^{L} = \frac{{\sum\nolimits_{r = 1}^{{s_{1} }} {u_{r}^{g} y_{r}^{Lg{\rm min}} } - \sum\nolimits_{p = 1}^{{s_{2} }} {u_{p}^{b} y_{p}^{Ub{\rm min}} } }}{{\sum\nolimits_{i = 1}^{m} {v_{i}^{{}} x_{i}^{Umax} } }} \hfill \\ & {\text{ s.t.}} \, {\text{ Constraints of}}\,{\text{model}}\,\,{(34)}{\text{.}} \hfill \\ \end{aligned} $$
(36)

By using Charnes–Cooper transformation, the model (36) can be transformed into a linear programming problem.

The second step in the lexicographic optimization of model (36) consists in solving the following model:

$$ \begin{aligned} &\varphi_{N}^{ * M} = \min \,\varphi_{N}^{M} = \frac{{\sum\nolimits_{r = 1}^{{s_{1} }} {u_{r}^{g} y_{r}^{Mg{\rm min}} } - \sum\nolimits_{p = 1}^{{s_{2} }} {u_{p}^{b} y_{p}^{Mb{\rm min}} } }}{{\sum\nolimits_{i = 1}^{m} {v_{i}^{{}} x_{i}^{Mmax} } }} \hfill \\ & {\text{ s.t.}} \, \varphi_{N}^{L} = \varphi_{N}^{ * L} \hfill \\ & {\text{Constraints of}}\,{\text{model}}\,\,{(34)}{\text{.}} \hfill \\ \end{aligned} $$
(37)

Clearly, the constraint \(\sum\nolimits_{r = 1}^{{s_{1} }} {u_{r}^{g} y_{r}^{Lg{\rm min}} - } \sum\nolimits_{p = 1}^{{s_{2} }} {u_{p}^{b} y_{p}^{Ub{\rm min}} }\) \(\ge 0\) of model (34) will be redundant for model (37) and can be removed. Similarly, by using Charnes–Cooper transformation, the model (37) can be transformed into a linear programming problem.

The third step in the lexicographic optimization of model (34) consists in solving the following model:

$$ \begin{aligned} & \tilde{\varphi }_{N}^{ * U} = \min \,\varphi_{N}^{U} = \frac{{\sum\nolimits_{r = 1}^{{s_{1} }} {u_{r}^{g} y_{r}^{Ug{\rm min}} } - \sum\nolimits_{p = 1}^{{s_{2} }} {u_{p}^{b} y_{p}^{Lb{\rm min}} } }}{{\sum\nolimits_{i = 1}^{m} {v_{i}^{{}} x_{i}^{Lmax} } }} \hfill \\ &{\text{ s.t.}} \, \varphi_{N}^{M} = \varphi_{N}^{ * M} , \hfill \\ & \varphi_{N}^{L} = \varphi_{N}^{ * L} , \hfill \\ & {\text{Constraints of}}\,{\text{model}}\,\,{(34)}{\text{.}} \hfill \\ \end{aligned} $$
(38)

The model (38) can be transformed into a linear programming problem by using Charnes–Cooper transformation.

The optimal values of models (36)–(38) give the worst fuzzy efficiency of FADMU as \(\tilde{\varphi }_{N}^{ * } \approx [\varphi_{N}^{ * L} ,\varphi_{N}^{*M} ,\varphi_{N}^{*U} ]\).

It is obvious that every feasible solution of model (36) is a feasible solution of model (31). This means that \(\varphi_{N}^{*L} \le \theta_{I}^{*L}\). Similarly, we can conclude that \(\varphi_{N}^{*M} \le \theta_{I}^{*M}\) and \(\varphi_{N}^{*U} \le \theta_{I}^{*U}\). Therefore, the following statement can be made:

Proposition 1

The worst fuzzy efficiency of FADMU is less or equal than the best fuzzy efficiency of the FIDMU, i.e., \(\tilde{\varphi }_{N}^{ * } \approx [\varphi_{N}^{ * L} ,\varphi_{N}^{*M} ,\varphi_{N}^{*U} ]\underline { \prec } \tilde{\theta }_{I}^{ * } \approx [\theta_{I}^{*L} ,\theta_{I}^{*M} ,\theta_{I}^{*U} ]\).

The best fuzzy efficiency of DMU

Now, we compute the best fuzzy relative efficiency of each DMU using the best fuzzy efficiency of FIDMU (\(\tilde{\theta }_{I}^{ * }\)). The following fuzzy model is used to determine the best fuzzy relative efficiency of each DMU using the optimum fuzzy efficiency of the FIDMU:

$$ \begin{aligned} & \tilde{\theta }_{o}^{ * } = {\rm max} \, \frac{{\sum\nolimits_{r = 1}^{{s_{1} }} {u_{r}^{g} \tilde{y}_{ro}^{g} - } \sum\nolimits_{p = 1}^{{s_{2} }} {u_{p}^{b} \tilde{y}_{po}^{b} } }}{{\sum\nolimits_{i = 1}^{m} {v_{i}^{{}} \tilde{x}_{io}^{{}} } }} \hfill \\ &{\text{s.t.}} \, \frac{{\sum\nolimits_{r = 1}^{{s_{1} }} {u_{r}^{g} \tilde{y}_{r}^{g{\rm max}} - } \sum\nolimits_{p = 1}^{{s_{2} }} {u_{p}^{b} \tilde{y}_{p}^{b{\rm max}} } }}{{\sum\nolimits_{i = 1}^{m} {v_{i}^{{}} \tilde{x}_{i}^{\rm min} } }} = \tilde{\theta }_{I}^{ * } \hfill \\ & \tilde{\theta }_{j}^{{}} = \frac{{\sum\nolimits_{r = 1}^{{s_{1} }} {u_{r}^{g} \tilde{y}_{rj}^{g} - } \sum\nolimits_{p = 1}^{{s_{2} }} {u_{p}^{b} \tilde{y}_{pj}^{b} } }}{{\sum\nolimits_{i = 1}^{m} {v_{i}^{{}} \tilde{x}_{ij}^{{}} } }} \le 1, \, j = 1,\ldots,n, \hfill \\ &\sum\limits_{r = 1}^{{s_{1} }} {u_{r}^{g} \tilde{y}_{rj}^{g} - } \sum\limits_{p = 1}^{{s_{2} }} {u_{p}^{b} \tilde{y}_{pj}^{b} } \ge 0, \, j = 1,\ldots,n, \hfill \\ & u_{r}^{g} \ge \varepsilon \, \forall r , \quad u_{p}^{b} \ge \varepsilon \, \forall p , \quad v_{i}^{{}} \ge \varepsilon \, \forall i. \hfill \\ \end{aligned} $$
(39)

The purpose of fuzzy model (39) is to maximize the fuzzy efficiency of DMUo (o = 1, 2, …, n) while the optimal fuzzy efficiency of the FIDMU is fixed by the first constraint in fuzzy model (39). By the use of triangular fuzzy numbers, the fuzzy model (3) is reformulated as follows:

$$ \begin{aligned} &\tilde{\theta }_{o}^{ * } = \left[ {\theta_{o}^{ * L} ,\theta_{o}^{ * M} ,\theta_{o}^{ * U} } \right] = max\left[ {\theta_{o}^{L} ,\theta_{o}^{M} ,\theta_{o}^{U} } \right] \hfill \\ & = \left[ {\frac{{\sum\nolimits_{r = 1}^{{s_{1} }} {u_{r}^{g} y_{ro}^{Lg} - } \sum\nolimits_{p = 1}^{{s_{2} }} {u_{p}^{b} y_{po}^{Ub} } }}{{\sum\nolimits_{i = 1}^{m} {v_{i}^{{}} x_{io}^{U} } }},\frac{{\sum\nolimits_{r = 1}^{{s_{1} }} {u_{r}^{g} y_{ro}^{Mg} - } \sum\nolimits_{p = 1}^{{s_{2} }} {u_{p}^{b} y_{po}^{Mb} } }}{{\sum\nolimits_{i = 1}^{m} {v_{i}^{{}} x_{io}^{M} } }},\frac{{\sum\nolimits_{r = 1}^{{s_{1} }} {u_{r}^{g} y_{ro}^{Ug} - } \sum\nolimits_{p = 1}^{{s_{2} }} {u_{p}^{b} y_{po}^{Lb} } }}{{\sum\nolimits_{i = 1}^{m} {v_{i}^{{}} x_{io}^{L} } }}} \right] \hfill \\ &{\text{s.t.}} \left[ {\frac{{\sum\nolimits_{r = 1}^{{s_{1} }} {u_{r}^{g} y_{r}^{Lg{\rm max}} } - \sum\nolimits_{p = 1}^{{s_{2} }} {u_{p}^{b} y_{p}^{Ub{\rm max}} } }}{{\sum\nolimits_{i = 1}^{m} {v_{i}^{{}} x_{i}^{U{\rm min}} } }},\frac{{\sum\nolimits_{r = 1}^{{s_{1} }} {u_{r}^{g} y_{r}^{Mg{\rm max}} } - \sum\nolimits_{p = 1}^{{s_{2} }} {u_{p}^{b} y_{p}^{Mb{\rm max}} } }}{{\sum\nolimits_{i = 1}^{m} {v_{i}^{{}} x_{i}^{M{\rm min}} } }},\frac{{\sum\nolimits_{r = 1}^{{s_{1} }} {u_{r}^{g} y_{r}^{Ug{\rm max}} } - \sum\nolimits_{p = 1}^{{s_{2} }} {u_{p}^{b} y_{p}^{Lb{\rm max}} } }}{{\sum\nolimits_{i = 1}^{m} {v_{i}^{{}} x_{i}^{L{\rm min}} } }}} \right] \hfill \\ &\quad = \left[ {\theta_{I}^{ * L} ,\theta_{I}^{ * M} ,\theta_{I}^{ * U} } \right] \hfill \\ &\left[ {\frac{{\sum\nolimits_{r = 1}^{{s_{1} }} {u_{r}^{g} y_{rj}^{Lg} - } \sum\nolimits_{p = 1}^{{s_{2} }} {u_{p}^{b} y_{pj}^{Ub} } }}{{\sum\nolimits_{i = 1}^{m} {v_{i}^{{}} x_{ij}^{U} } }},\frac{{\sum\nolimits_{r = 1}^{{s_{1} }} {u_{r}^{g} y_{rj}^{Mg} - } \sum\nolimits_{p = 1}^{{s_{2} }} {u_{p}^{b} y_{pj}^{Mb} } }}{{\sum\nolimits_{i = 1}^{m} {v_{i}^{{}} x_{ij}^{M} } }},\frac{{\sum\nolimits_{r = 1}^{{s_{1} }} {u_{r}^{g} y_{rj}^{Ug} - } \sum\nolimits_{p = 1}^{{s_{2} }} {u_{p}^{b} y_{pj}^{Lb} } }}{{\sum\nolimits_{i = 1}^{m} {v_{i}^{{}} x_{io}^{L} } }}} \right] \le 1, \, j = 1,\ldots,n, \hfill \\ &\left[ {\sum\limits_{r = 1}^{{s_{1} }} {u_{r}^{g} y_{rj}^{Lg} - } \sum\limits_{p = 1}^{{s_{2} }} {u_{p}^{b} y_{pj}^{Ub} } ,\sum\limits_{r = 1}^{{s_{1} }} {u_{r}^{g} y_{rj}^{Mg} - } \sum\limits_{p = 1}^{{s_{2} }} {u_{p}^{b} y_{pj}^{Mb} } ,\sum\limits_{r = 1}^{{s_{1} }} {u_{r}^{g} y_{rj}^{Ug} - } \sum\limits_{p = 1}^{{s_{2} }} {u_{p}^{b} y_{pj}^{Lb} } } \right] \ge 0, \, j = 1,\ldots,n, \hfill \\ & u_{r}^{g} \ge \varepsilon \, \forall r , \quad u_{p}^{b} \ge \varepsilon \, \forall p , \quad v_{i}^{{}} \ge \varepsilon \, \forall i. \hfill \\ \end{aligned} $$
(40)

The first constraint of model (40) is rewritten as follows:

$$ \begin{aligned} & \frac{{\sum\nolimits_{r = 1}^{{s_{1} }} {u_{r}^{g} y_{r}^{Lg{\rm max}} } - \sum\nolimits_{p = 1}^{{s_{2} }} {u_{p}^{b} y_{p}^{Ub{\rm max}} } }}{{\sum\nolimits_{i = 1}^{m} {v_{i}^{{}} x_{i}^{U{\rm min}} } }} = \theta_{I}^{ * L} , \hfill \\ &\frac{{\sum\nolimits_{r = 1}^{{s_{1} }} {u_{r}^{g} y_{r}^{Mg{\rm max}} } - \sum\nolimits_{p = 1}^{{s_{2} }} {u_{p}^{b} y_{p}^{Mb{\rm max}} } }}{{\sum\nolimits_{i = 1}^{m} {v_{i}^{{}} x_{i}^{M{\rm min}} } }} = \theta_{I}^{ * M} , \hfill \\ &\frac{{\sum\nolimits_{r = 1}^{{s_{1} }} {u_{r}^{g} y_{r}^{Ug{\rm max}} } - \sum\nolimits_{p = 1}^{{s_{2} }} {u_{p}^{b} y_{p}^{Lb{\rm max}} } }}{{\sum\nolimits_{i = 1}^{m} {v_{i}^{{}} x_{i}^{L{\rm min}} } }} = \theta_{I}^{ * U} . \hfill \\ \end{aligned} $$
(41)

The second constraint set of model (40) is simplified to the following constraint:

$$ \, \frac{{\sum\nolimits_{r = 1}^{{s_{1} }} {u_{r}^{g} y_{rj}^{Ug} - } \sum\nolimits_{p = 1}^{{s_{2} }} {u_{p}^{b} y_{pj}^{Lb} } }}{{\sum\nolimits_{i = 1}^{m} {v_{i}^{{}} x_{io}^{L} } }} \le 1, \, \,\,\,\,\,\,\,\,j = 1,\ldots,n, $$
(42)

The second constraint of model (40) is simplified to the following constraint:

$$ \sum\limits_{r = 1}^{{s_{1} }} {u_{r}^{g} y_{rj}^{Lg} - } \sum\limits_{p = 1}^{{s_{2} }} {u_{p}^{b} y_{pj}^{Ub} } \ge 0, \, \,\,\,\,\,\,\,\,j = 1,\ldots,n, $$
(43)

Now, regarding Eqs. (41), (42) and (43), we can rewrite model (40) as follows:

$$ \begin{aligned} &\tilde{\theta }_{o}^{ * } = \left[ {\theta_{o}^{ * L} ,\theta_{o}^{ * M} ,\theta_{o}^{ * U} } \right] = max\left[ {\theta_{o}^{L} ,\theta_{o}^{M} ,\theta_{o}^{U} } \right]\hfill \\ & = \left[ \frac{{\sum\nolimits_{r = 1}^{{s_{1} }} {u_{r}^{g} y_{ro}^{Lg} - } \sum\nolimits_{p = 1}^{{s_{2} }} {u_{p}^{b} y_{po}^{Ub} } }}{{\sum\nolimits_{i = 1}^{m} {v_{i}^{{}} x_{io}^{U} } }},\right.\\ &\quad\left.\frac{{\sum\nolimits_{r = 1}^{{s_{1} }} {u_{r}^{g} y_{ro}^{Mg} - } \sum\nolimits_{p = 1}^{{s_{2} }} {u_{p}^{b} y_{po}^{Mb} } }}{{\sum\nolimits_{i = 1}^{m} {v_{i}^{{}} x_{io}^{M} } }},\right.\\ & \quad \left.\frac{{\sum\nolimits_{r = 1}^{{s_{1} }} {u_{r}^{g} y_{ro}^{Ug} - } \sum\nolimits_{p = 1}^{{s_{2} }} {u_{p}^{b} y_{po}^{Lb} } }}{{\sum\nolimits_{i = 1}^{m} {v_{i}^{{}} x_{io}^{L} } }} \right] \hfill \\ &{\text{s.t.}} \sum\nolimits_{r = 1}^{{s_{1} }} {u_{r}^{g} y_{r}^{Lg{\rm max}} }\\ &\quad - \sum\nolimits_{p = 1}^{{s_{2} }} {u_{p}^{b} y_{p}^{Ub{\rm max}} } - \theta_{I}^{ * L} \sum\nolimits_{i = 1}^{m} {v_{i}^{{}} x_{i}^{U{\rm min}} } = 0, \hfill \\ &\sum\limits_{r = 1}^{{s_{1} }} {u_{r}^{g} y_{r}^{Mg{\rm max}} } - \sum\limits_{p = 1}^{{s_{2} }} {u_{p}^{b} y_{p}^{Mb{\rm max}} } - \theta_{I}^{ * M} \sum\limits_{i = 1}^{m} {v_{i}^{{}} x_{i}^{M{\rm min}} } = 0, \hfill \\ &\sum\limits_{r = 1}^{{s_{1} }} {u_{r}^{g} y_{r}^{Ug{\rm max}} } - \sum\limits_{p = 1}^{{s_{2} }} {u_{p}^{b} y_{p}^{Lb{\rm max}} } - \theta_{I}^{ * U} \sum\limits_{i = 1}^{m} {v_{i}^{{}} x_{i}^{L{\rm min}} } = 0, \hfill \\ & \,\sum\limits_{r = 1}^{{s_{1} }} {u_{r}^{g} y_{rj}^{Ug} - } \sum\limits_{p = 1}^{{s_{2} }} {u_{p}^{b} y_{pj}^{Lb} - \sum\limits_{i = 1}^{m} {v_{i}^{{}} x_{ij}^{L} } } \le 0, \, \,\,\,\,\,\,\,\,j = 1,\ldots,n, \hfill \\ & \sum\limits_{r = 1}^{{s_{1} }} {u_{r}^{g} y_{rj}^{Lg} - } \sum\limits_{p = 1}^{{s_{2} }} {u_{p}^{b} y_{pj}^{Ub} } \ge 0, \, \,\,\,\,\,\,\,\,j = 1,\ldots,n, \hfill \\ & u_{r}^{g} \ge \varepsilon \, \forall r , \quad u_{p}^{b} \ge \varepsilon \, \forall p , \quad v_{i}^{{}} \ge \varepsilon \, \forall i. \hfill \\ \end{aligned} $$
(44)

The first, second and third steps in the lexicographic optimization of model (44) involve solving, successively, the following three models:

$$ \begin{aligned} &\theta_{o}^{ * L} = max\theta_{o}^{L} { = }\frac{{\sum\nolimits_{r = 1}^{{s_{1} }} {u_{r}^{g} y_{ro}^{Lg} - } \sum\nolimits_{p = 1}^{{s_{2} }} {u_{p}^{b} y_{po}^{Ub} } }}{{\sum\nolimits_{i = 1}^{m} {v_{i}^{{}} x_{io}^{U} } }} \hfill \\ & {\text{s.t.}} \,{\text{Constraints}}\,{\text{of}}\,{\text{model}}\,{(44)}{\text{.}} \hfill \\ \end{aligned} $$
(45)
$$ \begin{aligned} &\theta_{o}^{ * M} = max\theta_{o}^{M} { = }\frac{{\sum\nolimits_{r = 1}^{{s_{1} }} {u_{r}^{g} y_{ro}^{Mg} - } \sum\nolimits_{p = 1}^{{s_{2} }} {u_{p}^{b} y_{po}^{Mb} } }}{{\sum\nolimits_{i = 1}^{m} {v_{i}^{{}} x_{io}^{M} } }} \hfill \\ & {\text{s.t.}} \,\theta_{o}^{L} = \theta_{o}^{ * L} , \hfill \\ &{\text{Constraints}}\,{\text{of}}\,{\text{model}}\,{(44)}{\text{.}} \hfill \\ \end{aligned} $$
(46)
$$ \begin{aligned} &\theta_{o}^{ * U} = max\theta_{o}^{U} { = }\frac{{\sum\nolimits_{r = 1}^{{s_{1} }} {u_{r}^{g} y_{ro}^{Ug} - } \sum\nolimits_{p = 1}^{{s_{2} }} {u_{p}^{b} y_{po}^{Lb} } }}{{\sum\nolimits_{i = 1}^{m} {v_{i}^{{}} x_{io}^{L} } }} \hfill \\ & {\text{s.t.}} \,\theta_{o}^{M} = \theta_{o}^{ * M} , \hfill \\ &\theta_{o}^{L} = \theta_{o}^{ * L} , \hfill \\ & {\text{Constraints}}\,{\text{of}}\,{\text{model}}\,{(44)}{\text{.}} \hfill \\ \end{aligned} $$
(47)

It should be noted that every feasible solution of model (46) is also a feasible solution of model (31). This means that \(\theta_{o}^{ * L} \le \theta_{I}^{ * L} \,\,(0 = 1,2,\ldots,n)\). Similarly, \(\theta_{o}^{ * M} \le \theta_{I}^{ * M} \,\,(0 = 1,2,\ldots,n)\) and \(\theta_{o}^{ * U} \le \theta_{I}^{ * U} \,\,(0 = 1,2,\ldots,n)\). Therefore, the following statement can be made:

Proposition 2

The best fuzzy efficiency of every DMU under evaluation is less or equal than the best fuzzy efficiency of the FIDMU, i.e., \(\tilde{\theta }_{j}^{ * } \approx [\theta_{j}^{ * L} ,\theta_{j}^{ * M} ,\theta_{j}^{ * U} ]\underline { \prec } \tilde{\theta }_{I}^{ * } \approx [\theta_{I}^{ * L} ,\theta_{I}^{ * M} ,\theta_{I}^{ * U} ]\,,\,\,(j = 1,2,\ldots,n)\).

The worst fuzzy efficiency of DMU

Now, we compute the worst fuzzy relative efficiency of each DMU using the worst fuzzy efficiency of FADMU (\(\tilde{\varphi }_{N}^{ * }\)). The following fuzzy model is used to determine the worst fuzzy relative efficiency of each DMU using the optimum fuzzy efficiency of the FADMU:

$$ \begin{aligned} &\tilde{\varphi }_{o}^{ * } = {\rm min} \, \frac{{\sum\nolimits_{r = 1}^{{s_{1} }} {u_{r}^{g} \tilde{y}_{ro}^{g} - } \sum\nolimits_{p = 1}^{{s_{2} }} {u_{p}^{b} \tilde{y}_{po}^{b} } }}{{\sum\nolimits_{i = 1}^{m} {v_{i}^{{}} \tilde{x}_{io}^{{}} } }} \hfill \\ & {\rm s.t.} \, \frac{{\sum\nolimits_{r = 1}^{{s_{1} }} {u_{r}^{g} \tilde{y}_{r}^{g{\rm min}} - } \sum\nolimits_{p = 1}^{{s_{2} }} {u_{p}^{b} \tilde{y}_{p}^{b{\rm min}} } }}{{\sum\nolimits_{i = 1}^{m} {v_{i}^{{}} \tilde{x}_{i}^{\rm max} } }} = \tilde{\varphi }_{N}^{ * } \hfill \\ & \tilde{\varphi }_{j}^{{}} = \frac{{ \, \sum\nolimits_{r = 1}^{{s_{1} }} {u_{r}^{g} \tilde{y}_{rj}^{g} - } \sum\nolimits_{p = 1}^{{s_{2} }} {u_{p}^{b} \tilde{y}_{pj}^{b} } }}{{\sum\nolimits_{i = 1}^{m} {v_{i}^{{}} \tilde{x}_{ij}^{{}} } }} \le 1, \, j = 1,\ldots,n, \hfill \\ & \sum\limits_{r = 1}^{{s_{1} }} {u_{r}^{g} \tilde{y}_{rj}^{g} - } \sum\limits_{p = 1}^{{s_{2} }} {u_{p}^{b} \tilde{y}_{pj}^{b} } \ge 0, \, j = 1,\ldots,n, \hfill \\ & u_{r}^{g} \ge \varepsilon \, \forall r , \quad u_{p}^{b} \ge \varepsilon \, \forall p , \quad v_{i}^{{}} \ge \varepsilon \, \forall i. \hfill \\ \end{aligned} $$
(48)

The purpose of fuzzy model (48) is to minimize the fuzzy efficiency of DMUo (o = 1, 2, …, n) while the optimal fuzzy efficiency of the FADMU is fixed by the first constraint in fuzzy model (48). By the use of triangular fuzzy numbers, the fuzzy model (3) is reformulated as follows:

$$ \begin{aligned} &\tilde{\varphi }_{o}^{ * } = min\,\left[ {\varphi_{o}^{L} ,\varphi_{o}^{M} ,\varphi_{o}^{U} } \right] \hfill \\ & =\left[ {\frac{{\sum\nolimits_{r = 1}^{{s_{1} }} {u_{r}^{g} y_{ro}^{Lg} - } \sum\nolimits_{p = 1}^{{s_{2} }} {u_{p}^{b} y_{po}^{Ub} } }}{{\sum\nolimits_{i = 1}^{m} {v_{i}^{{}} x_{io}^{U} } }},\frac{{\sum\nolimits_{r = 1}^{{s_{1} }} {u_{r}^{g} y_{ro}^{Mg} - } \sum\nolimits_{p = 1}^{{s_{2} }} {u_{p}^{b} y_{po}^{Mb} } }}{{\sum\nolimits_{i = 1}^{m} {v_{i}^{{}} x_{io}^{M} } }},\frac{{\sum\nolimits_{r = 1}^{{s_{1} }} {u_{r}^{g} y_{ro}^{Ug} - } \sum\nolimits_{p = 1}^{{s_{2} }} {u_{p}^{b} y_{po}^{Lb} } }}{{\sum\nolimits_{i = 1}^{m} {v_{i}^{{}} x_{io}^{L} } }}} \right] \hfill \\ & {\rm s.t.}\left[ { \, \frac{{\sum\nolimits_{r = 1}^{{s_{1} }} {u_{r}^{g} y_{r}^{Lg{\rm min}} - } \sum\nolimits_{p = 1}^{{s_{2} }} {u_{p}^{b} y_{p}^{Ub{\rm min}} } }}{{\sum\nolimits_{i = 1}^{m} {v_{i}^{{}} x_{i}^{Umax} } }},\frac{{\sum\nolimits_{r = 1}^{{s_{1} }} {u_{r}^{g} y_{r}^{Mg{\rm min}} - } \sum\nolimits_{p = 1}^{{s_{2} }} {u_{p}^{b} y_{p}^{Mb{\rm min}} } }}{{\sum\nolimits_{i = 1}^{m} {v_{i}^{{}} x_{i}^{Mmax} } }},\frac{{\sum\nolimits_{r = 1}^{{s_{1} }} {u_{r}^{g} y_{r}^{Ug{\rm min}} - } \sum\nolimits_{p = 1}^{{s_{2} }} {u_{p}^{b} y_{p}^{Lb{\rm min}} } }}{{\sum\nolimits_{i = 1}^{m} {v_{i}^{{}} x_{i}^{Lmax} } }}} \right] \hfill \\ &\quad = \left[ {\varphi_{N}^{ * L} ,\varphi_{N}^{ * M} ,\varphi_{N}^{ * U} } \right] \hfill \\ &\left[ {\frac{{\sum\nolimits_{r = 1}^{{s_{1} }} {u_{r}^{g} y_{rj}^{Lg} - } \sum\nolimits_{p = 1}^{{s_{2} }} {u_{p}^{b} y_{pj}^{Ub} } }}{{\sum\nolimits_{i = 1}^{m} {v_{i}^{{}} x_{ij}^{U} } }},\frac{{\sum\nolimits_{r = 1}^{{s_{1} }} {u_{r}^{g} y_{rj}^{Mg} - } \sum\nolimits_{p = 1}^{{s_{2} }} {u_{p}^{b} y_{pj}^{Mb} } }}{{\sum\nolimits_{i = 1}^{m} {v_{i}^{{}} x_{ij}^{M} } }},\frac{{\sum\nolimits_{r = 1}^{{s_{1} }} {u_{r}^{g} y_{rj}^{Ug} - } \sum\nolimits_{p = 1}^{{s_{2} }} {u_{p}^{b} y_{pj}^{Lb} } }}{{\sum\nolimits_{i = 1}^{m} {v_{i}^{{}} x_{ij}^{L} } }}} \right] \le 1, \, j = 1,\ldots,n, \hfill \\ &\left[ {\sum\limits_{r = 1}^{{s_{1} }} {u_{r}^{g} y_{rj}^{Lg} - } \sum\limits_{p = 1}^{{s_{2} }} {u_{p}^{b} y_{pj}^{Ub} } ,\sum\limits_{r = 1}^{{s_{1} }} {u_{r}^{g} y_{rj}^{Mg} - } \sum\limits_{p = 1}^{{s_{2} }} {u_{p}^{b} y_{pj}^{Mb} } ,\sum\limits_{r = 1}^{{s_{1} }} {u_{r}^{g} y_{rj}^{Ug} - } \sum\limits_{p = 1}^{{s_{2} }} {u_{p}^{b} y_{pj}^{Lb} } } \right] \ge 0, \, j = 1,\ldots,n, \hfill \\ & u_{r}^{g} \ge \varepsilon \, \forall r , \quad u_{p}^{b} \ge \varepsilon \, \forall p , \quad v_{i}^{{}} \ge \varepsilon \, \forall i. \hfill \\ \end{aligned} $$
(49)

Similar to previous discussions, the fuzzy DEA model (49) is reformulated as follows:

$$ \begin{aligned} & \tilde{\varphi }_{o}^{ * } = {\rm min}\,\left[ {\varphi_{o}^{L} ,\varphi_{o}^{M} ,\varphi_{o}^{U} } \right] \hfill \\ &= \left[ \frac{{\sum\nolimits_{r = 1}^{{s_{1} }} {u_{r}^{g} y_{ro}^{Lg} - } \sum\nolimits_{p = 1}^{{s_{2} }} {u_{p}^{b} y_{po}^{Ub} } }}{{\sum\nolimits_{i = 1}^{m} {v_{i}^{{}} x_{io}^{U} } }},\right.\\ & \quad\left.\frac{{\sum\nolimits_{r = 1}^{{s_{1} }} {u_{r}^{g} y_{ro}^{Mg} - } \sum\nolimits_{p = 1}^{{s_{2} }} {u_{p}^{b} y_{po}^{Mb} } }}{{\sum\nolimits_{i = 1}^{m} {v_{i}^{{}} x_{io}^{M} } }},\right.\\ & \quad\left.\frac{{\sum\nolimits_{r = 1}^{{s_{1} }} {u_{r}^{g} y_{ro}^{Ug} - } \sum\nolimits_{p = 1}^{{s_{2} }} {u_{p}^{b} y_{po}^{Lb} } }}{{\sum\nolimits_{i = 1}^{m} {v_{i}^{{}} x_{io}^{L} } }} \right] \hfill \\ & {\rm s.t.}\,\,\sum\limits_{r = 1}^{{s_{1} }} {u_{r}^{g} y_{r}^{Lg{\rm min}} - } \sum\limits_{p = 1}^{{s_{2} }} {u_{p}^{b} y_{p}^{Ub{\rm min}} } - \varphi_{N}^{ * L} \sum\limits_{i = 1}^{m} {v_{i}^{{}} x_{i}^{Umax} } = 0, \hfill \\ & \sum\limits_{r = 1}^{{s_{1} }} {u_{r}^{g} y_{r}^{Mg{\rm min}} - } \sum\limits_{p = 1}^{{s_{2} }} {u_{p}^{b} y_{p}^{Mb{\rm min}} } \,\, - \varphi_{N}^{ * M} \sum\limits_{i = 1}^{m} {v_{i}^{{}} x_{i}^{Mmax} } = 0, \hfill \\ & \sum\limits_{r = 1}^{{s_{1} }} {u_{r}^{g} y_{r}^{Ug{\rm min}} - } \sum\limits_{p = 1}^{{s_{2} }} {u_{p}^{b} y_{p}^{Lb{\rm min}} } - \varphi_{N}^{ * U} \sum\limits_{i = 1}^{m} {v_{i}^{{}} x_{i}^{Lmax} } = 0, \hfill \\ & \sum\limits_{r = 1}^{{s_{1} }} {u_{r}^{g} y_{rj}^{Ug} - } \sum\limits_{p = 1}^{{s_{2} }} {u_{p}^{b} y_{pj}^{Lb} - \sum\limits_{i = 1}^{m} {v_{i}^{{}} x_{ij}^{L} } } \le 0, \quad j = 1,\ldots,n, \hfill \\ & \sum\limits_{r = 1}^{{s_{1} }} {u_{r}^{g} y_{rj}^{Lg} - } \sum\limits_{p = 1}^{{s_{2} }} {u_{p}^{b} y_{pj}^{Ub} } \, \ge 0, \quad j = 1,\ldots,n, \hfill \\ & u_{r}^{g} \ge \varepsilon \, \forall r , \quad u_{p}^{b} \ge \varepsilon \, \forall p , \quad v_{i}^{{}} \ge \varepsilon \, \forall i. \hfill \\ \end{aligned} $$
(50)

The first, second and third steps in the lexicographic optimization of model (50) involve solving, successively, the following three models:

$$ \begin{aligned} & \varphi_{o}^{*L} = \min \frac{{\sum\nolimits_{r = 1}^{{s_{1} }} {u_{r}^{g} y_{ro}^{Lg} - } \sum\nolimits_{p = 1}^{{s_{2} }} {u_{p}^{b} y_{po}^{Ub} } }}{{\sum\nolimits_{i = 1}^{m} {v_{i}^{{}} x_{io}^{U} } }} \hfill \\ & {\rm s.t.}\,\,{\text{Constraints}}\,{\text{of}}\,{\text{model}}\,{(50)}{\text{.}} \hfill \\ \end{aligned} $$
(51)
$$ \begin{aligned} &\varphi_{o}^{*M} = \min \frac{{\sum\nolimits_{r = 1}^{{s_{1} }} {u_{r}^{g} y_{ro}^{Mg} - } \sum\nolimits_{p = 1}^{{s_{2} }} {u_{p}^{b} y_{po}^{Mb} } }}{{\sum\nolimits_{i = 1}^{m} {v_{i}^{{}} x_{io}^{M} } }} \hfill \\ & {\rm s.t.}\,\,\varphi_{o}^{L} = \varphi_{o}^{*L} \hfill \\ & {\text{Constraints}}\,{\text{of}}\,{\text{model}}\,{(50)}{\text{.}} \hfill \\ \end{aligned} $$
(52)
$$ \begin{aligned} & \varphi_{o}^{*U} = \min \frac{{\sum\nolimits_{r = 1}^{{s_{1} }} {u_{r}^{g} y_{ro}^{Ug} - } \sum\nolimits_{p = 1}^{{s_{2} }} {u_{p}^{b} y_{po}^{Lb} } }}{{\sum\nolimits_{i = 1}^{m} {v_{i}^{{}} x_{io}^{L} } }} \hfill \\ & {\rm s.t.}\,\,\,\varphi_{o}^{M} = \varphi_{o}^{*M} , \hfill \\ & \varphi_{o}^{L} = \varphi_{o}^{*L} , \hfill \\ & {\text{Constraints}}\,{\text{of}}\,{\text{model}}\,{(50)}{\text{.}} \hfill \\ \end{aligned} $$
(53)

The optimal values of models (51)–(53) yields the worst fuzzy efficiency of \({\text{DMU}}_{o} \,\,(0 = 1,2,\ldots,n)\). It should be noted that every feasible solution of model (51) is also a feasible solution of model (36). This means that \(\varphi_{o}^{ * L} \le \varphi_{N}^{ * L} \,\,(0 = 1,2,\ldots,n)\). Similarly, \(\varphi_{o}^{ * M} \le \varphi_{N}^{ * M} \,\,(0 = 1,2,\ldots,n)\) and \(\varphi_{o}^{ * U} \le \varphi_{N}^{ * U} \,\,(0 = 1,2,\ldots,n)\). Therefore, the following statement can be made:

Proposition 3

The worst fuzzy efficiency of every DMU under evaluation is more or equal than the worst fuzzy efficiency of the FADMU, i.e., \(\tilde{\varphi }_{j}^{ * } \approx [\varphi_{j}^{ * L} ,\varphi_{j}^{ * M} ,\varphi_{j}^{ * U} ] \, \underline { \succ } \, \tilde{\varphi }_{N}^{ * } \approx [\varphi_{N}^{ * L} ,\varphi_{N}^{ * M} ,\varphi_{N}^{ * U} ]\,,\,\,(j = 1,2,\ldots,n)\).

Proposition 4

The worst fuzzy efficiency of every DMU under evaluation is less or equal than the best fuzzy efficiency of the same DMU, i.e., \(\tilde{\varphi }_{j}^{ * } \approx [\varphi_{j}^{ * L} ,\varphi_{j}^{ * M} ,\varphi_{j}^{ * U} ] \, \underline { \prec } \, \tilde{\theta }_{j}^{ * } \approx [\theta_{j}^{ * L} ,\theta_{j}^{ * M} ,\theta_{j}^{ * U} ],\,\,(j = 1,2,\ldots,n)\).

Fuzzy relative closeness to FIDMU

Here, we describe a method to integrate the best and worst fuzzy efficiencies of FDMU in order to find a total ranking of DMUs.

In short, the best fuzzy relative efficiencies of virtual FIDMU and real fuzzy \({\text{DMU}}_{o} \,\,(0 = 1,2,\ldots,n)\) are computed based on models (31)–(33) and (45)–(47), respectively. Moreover, the worst fuzzy relative efficiencies of virtual FADMU and real fuzzy \({\text{DMU}}_{o} \,\,(o = 1,2,\ldots,n)\) are computed based on models (36)–(38) and (51)–(53), respectively. The fuzzy best and worst efficiency assessments may lead to completely different results. To overcome this problem, we extend the concept of the fuzzy relative closeness to give an overall assessment of each DMU. The fuzzy relative closeness to FIDMU is defined as follows:

$$ \mathop {{\text{RC}}}\limits^{ \sim }_{o} = \frac{{\tilde{\varphi }_{o}^{*} - \tilde{\varphi }_{N}^{*} }}{{(\tilde{\varphi }_{o}^{*} - \tilde{\varphi }_{N}^{*} ) + (\tilde{\theta }_{I}^{*} - \tilde{\theta }_{o}^{*} )}} $$
(54)

The proposed approach uses \(\mathop {{\text{RC}}}\limits^{ \sim }_{o}\) to rank \({\text{DMU}}_{o} \,\,(0 = 1,2,\ldots,n)\). The larger \(\mathop {{\text{RC}}}\limits^{ \sim }_{o}\) is, the larger is the rank of \({\text{DMU}}_{o}\).

By solving models (31)–(33), (45)–(47), (36)–(38) and (51)–(53), we can get the fuzzy relative closeness of the n fuzzy DMUs according to Eq. (54), based on which the DMUs can be compared and ranked with the help of the ranking approach developed in the Sect. 3.1. This means that each \(\mathop {RC}\limits^{ \sim }_{o}\)\(\,(o = 1,2,\ldots,n)\) is considered as a fuzzy number and ranked according to Eq. (7).

Remark 3

Note that if the all data are crisp numbers, then our fuzzy DEA models are reduced to the crisp DEA models. In fact, if \(x_{ij}^{L} = x_{ij}^{M} = x_{ij}^{U} = x_{ij}\) and \(y_{rj}^{L} = y_{rj}^{M} = y_{rj}^{U} = y_{rj}\), then (23) is reduced to (15) and so FIDMU and FADMU are reduced to IDMU and ADMU, respectively. Consequently, models (26), (34), (39) and (48) are simplified to (16)–(19), respectively. Finally, the fuzzy relative closeness to FIDMU given in (54) is simplified to the relative closeness to IDMU given in Remark 1. This confirms in such a case these results are consistent with the results of crisp DEA formulation.

Figure 1 sums up the proposed framework in this study using five structured successive phases.

Fig. 1
figure 1

The proposed algorithm

Numerical example

To illustrate the efficiency of the proposed method, we examine a numerical example. This example was originally introduced by Puri and Yadav [50]. Twelve DMUs are considered with two inputs, two desirable outputs and one undesirable output, where all the input and output data are triangular fuzzy numbers as listed in Table 2. The virtual FIDMU and FADMU are defined in the last two rows of Table 2.

Table 2 Fuzzy input–output data, FIDMU and FADMU

By solving models (31)–(33), the best fuzzy relative efficiency of FIADM is obtained as \(\tilde{\theta }_{I}^{*} = \left( {1.7195,1.8689,2.0666} \right)\). Moreover, by solving models (36)–(38), the worst fuzzy relative efficiencies of virtual FADMU are yielded as \(\tilde{\varphi }_{N}^{*} = \left( {0.2136,0.2400,0.2623} \right)\). We use models (45)–(47) to compute the best fuzzy relative efficiency of the real DMUs and models (51)–(53) to measure the worst fuzzy relative efficiency of the real DMUs. The resulting fuzzy efficiencies are presented in Table 3.

Table 3 The best and worst fuzzy relative efficiency values

Now, we obtain the fuzzy relative closeness of the fuzzy DMUs according to Eq. (54) DMUs. The resulting fuzzy relative closeness is presented in Table 4.

Table 4 Values of \({\text{R}}\tilde{{\rm C}}_{j}\)

To provide full ranking of performance for the 12 DMUs, Tables 5 and 6 show the values of \(S_{\min }^{\alpha }\) and \(S_{\max }^{\alpha }\) at different levels of \(\alpha \in (0,1]\) calculated by Eqs. (3) and (5), respectively.

Table 5 The values of \(S_{\max }^{\alpha }\) at different levels of \(\alpha \in (0,1]\)
Table 6 The values of \(S_{\min }^{\alpha }\) at different levels of \(\alpha \in (0,1]\)

Table 7 shows the relative closeness for the twelve DMUs at different levels of \(\alpha \in (0,1]\) calculated by Eq. (7). Table 8 gives the ranking results based on obtained relative closeness of DMUs. The graphical representation of the relative closeness values is shown in Fig. 2.

Table 7 The values of RC at different levels of \(\alpha \in (0,1]\)
Table 8 Ranks of the DMUs at different levels of \(\alpha \in (0,1]\)
Fig. 2
figure 2

The relative closeness values at different levels \(\alpha \in (0,1]\)

As can be seen from Table 7 when the value of α increases the relative closeness values for all DMUs increase. The relative closeness values obtained for the twelve DMUs at different levels \(\alpha \in \left\{ {0.1,0.2,0.3,0.4,0.5,0.6,0.7,0.8,0.9,1.0} \right\}\) illustrated in Fig. 2 which can be helpful for the sensitivity analysis of DMUs. Figures 3 and 4 show the ranking results of the DMUs according to the proposed method and the Puri and Yadav’s approach [50] method, respectively. Figure 3 illustrates the extent of variations in the ranking of DMUs at different levels \(\alpha \in \left\{ {0.1,0.2,0.3,0.4,0.5,0.6,0.7,0.8,0.9,1.0} \right\}\). This figure shows the influence of an optimistic \(\alpha\) on DMU ranking and can provide the decision maker with a valuable insight into the quality of management decisions and business policies.

Fig. 3
figure 3

Changes in rankings at different levels of \(\alpha \in (0,1]\) based on the proposed method

Fig. 4
figure 4

Changes in DMU rankings at different levels of \(\alpha \in (0,1]\) based on Puri and Yadav method [50]

It is worth noting that the upper bounds of the best fuzzy relative efficiency results (\(\theta_{o}^{ * U}\)) are same with those evaluated using crisp input–output data. The graphical representations of the efficiency results using crisp and fuzzy input–output data are shown in Fig. 5 [50] and Table 3, respectively. Carefully observing Fig. 5 and Table 3, we can analyze the impact of fuzzy data on the efficiency results of the DMUs. Table 3 reveals that \(DMU_{1}\), \(DMU_{2}\) and \(DMU_{4}\) are only efficient at the upper bound of best fuzzy relative efficiency and other DMUs are not efficient, Also the upper boundary values of the best and worst fuzzy relative efficiencies of other units are less than when these are evaluated using crisp input and output data. This implies that with the variation in the data from crisp to fuzzy, the efficiency measure of almost every DMU varies. Thus, the efficiency results obtained using fuzzy input–output data are more realistic and robust as compared to the results obtained using crisp data. The complete ranking of the efficient DMUs at \(\alpha \in (0,1]\), using the ranking algorithm discussed in Sect. 4.2.6, is presented in Table 8. It shows that the ranking is different at different levels of \(\alpha \in (0,1]\). Hence, we can conclude that the change at a given satisfaction level not only affects the efficiency results, but also affects the rankings of the DMUs.

Fig. 5
figure 5

Efficiency results with crisp data [50]

To compare the ability to discriminate DMUs based on our approach with that based on Puri and Yadav’s approach [50], as can be seen from Table 8, by both approaches, DMUs 11, 8, 6 and 5 have the last rank when \(\alpha\) takes \(0.5\). However, by our approach, DMUs 1, 2, 4 and 12 take the first place, second place, third place and fourth place, respectively, while by the existing approach [50], DMUs 2, 14, 12 and 1 take the first place, second place, third place and fourth place, respectively. Different from the existing approach [50] in which each DMU is evaluated based on only the optimistic perspective, each DMU is evaluated from both the optimistic and pessimistic perspectives according to our proposed approach. So, our final rank for 12 DMUS is more reasonable.

Different from the above mentioned point, the main advantages of the proposed approach over the Puri and Yadav’s approach [50] to deal with undesirable outputs with fuzzy data are summarized as follows:

  • The existing approach [50] only evaluates the performance of each fuzzy DMU based on the optimistic perspective, while our proposed approach provides the overall performance assessment of each fuzzy DMU from both the optimistic and pessimistic perspectives.

  • Puri and Yadav [50] have used alpha-cut approach for solving fuzzy DEA models with undesirable outputs. According to this approach, the membership function is derived numerically and consequently, the membership degree of a specific efficiency must be approximated from the alpha-cut. In this study, we improved the fuzzy arithmetic approach for solving fuzzy DEA models with undesirable outputs to derive the mathematical form of the membership function of the fuzzy efficiency and consequently the membership degree can be calculated directly.

  • Fuzzy efficiency measures derived from our proposed approach provide the range that all possible values derived from Puri and Yadav’s approach can appear within.

  • Since the efficiency measure is expressed by the membership function rather than by a crisp value, more information is provided for making decisions. This prevents the decision maker from making inappropriate decisions

  • The LP problems required to solve the FDEA models based on our proposed approach have less constraints and variables compared with LP problems derived from Puri and Yadav’s approach. Therefore, the main advantage of proposed method is that utilizing LP problems for solving FDEA models is highly economical compared with those derived from Puri and Yadav’s approach from a computational viewpoint, regarding the number of constraints and variables.

Concluding remarks

These days a number of researchers have shown interest in the area of fuzzy data envelopment analysis and various attempts have been made to study the solution of fuzzy DEA models. In this paper we proposed a novel fuzzy DEA framework that handles fuzzy input and output data in the presence of undeniable outputs. We introduced two virtual fuzzy DMUs, namely fuzzy ideal DMU and fuzzy anti ideal DMU in the fuzzy DEA framework. Then, we measured the best fuzzy relative efficiency of FIADM and the worst fuzzy efficiency of FADMU. We used the best fuzzy relative efficiency of FIADM to find the best fuzzy relative efficiencies of DMUs and the worst fuzzy relative efficiency of FADMU to find the worst fuzzy relative efficiencies of DMUs. We combined the best and worst fuzzy efficiencies in order to find a fuzzy relative closeness of each DMU to FADMU. To provide a full ranking of performances for the DMUs, we proposed a new ranking fuzzy numbers approach based on which the DMUs were compared and ranked.

It is important to notice that traditional DEA model evaluates DMUs from the view of the best possible relative efficiency by allowing each DMU to choose the most favorable weight. According to this point of view, efficiency assessment is implemented based on the optimistic perspective which would cause the problem that all DMUs cannot be fully discriminated. To solve this problem, some scholars have proposed the common weights DEA method in order to give a complete ranking for all efficient DMUs. Also, some researchers introduced worst practice DEA models to assess the worst possible relative efficiencies for DMUs and integrated the distinctive efficiencies resulting from the optimistic and pessimistic perspectives to provide the overall performance assessment of each DMU as the basis of comparing and ranking the DMUs. In this study, we developed this approach in fuzzy environment to evaluate of DMUs with fuzzy inputs and outputs. Thus, proposing new models to extend the existing FDEA model for generating common weight in fuzzy environment is very interesting in the future research.

On the other hand, this work uses direct approaches to incorporate undesirable outputs in fuzzy DEA models. How to extend indirect approaches on modeling undesirable outputs into fuzzy DEA and analyzing their impact on the performance of fuzzy DMUs is also very interesting in the future.