Overall profit Malmquist productivity index under data uncertainty

Abstract

The calculation of the overall profit Malmquist productivity index (MPI) requires precise and accurate information on the input, output, input-output prices of each decision making unit (DMU). However, in many situations, some inputs and/or outputs and input-output prices are imprecise. As such, we consider the overall profit MPI problem when the input, output, and input-output prices are imprecise and vary over intervals, showing that method (MCM 54: 2827–2838, 2011) has some shortfalls. To remedy these shortfalls, we propose another method for measuring the overall profit MPI when the inputs, outputs, and price vectors vary over intervals. That is, to calculate the overall profit efficiency intervals, cone-ratio data envelopment analysis models can be applied to the incorporated information as weight restrictions. Further, we provide a new approach to calculating the upper bound of the overall profit efficiency of each DMU. A numerical example is provided for illustrating the proposed method.

Introduction

The Malmquist productivity index (MPI) is one of the most popular approaches to measuring productivity changes over time and was introduced by Malmquist (1953). Under data envelopment analysis (DEA), productivity is defined as the ratio between efficiency and is measured by MPI for the same decision making unit (DMU) in two different periods. Caves et al. (1982a;1982b) proposed an MPI as the ratio of two input distance functions to calculate the relative performance of a DMU in different periods. Färe et al. (1994) extended the approach of Caves et al. (1982a) and constructed an MPI directly using input and output data as the geometric mean of the MPIs calculated in the two base periods. Using Farrell’s (1957) methodology for the measurement of efficiency and that of Caves et al. (1982a) on the measurement of productivity, Färe et al. (1994) constructed an MPI directly from input and output data using DEA. However, this conventional profit MPI requires the input-output quantity and exact input-output prices to be available. However, in many situations, some inputs and/or outputs and input-output prices have imprecise data. Therefore, conventional profit MPI models are not suitable or applicable to measuring overall profit MPI.

Asmild et al. (2007) presented a framework in which DEA was used to measure the overall efficiencies of different behavioral objectives. Furthermore, they showed how this framework could be applied to assess the effectiveness of more general behavioral goals. These objectives are revenue maximization, cost minimization, and profit maximization. Asmild et al. (2007) clarified the relationships between various cone-ratio DEA (CR-DEA) models and those used to measure overall efficiency. Aghayi et al. () evaluated the MPI of DMUs with desirable and undesirable interval outputs. To deal with data uncertainty, a fuzzy approach was proposed by Wanke et al. (2016), who also calculated the efficiency of banks. Mashayekhi and Omrani (2016) used a fuzzy approach for sorting genetic algorithms with uncertain data. Salehpour and Aghayi (2015) calculated revenue efficiency under price uncertainty to find a solution to minimizing the worst-case performance with uncertain data. Hatami-Marbini et al. (2018) developed an overarching evaluation process for estimating the RTS of DMUs under imprecise DEA (IDEA), where the input and output data lie within bounded intervals. For more on IDEA, see Shabani et al. (2019), Ebrahimi (2018), Fazelabdolabadi (2019), Toloo et al. (2018), Shokouhi et al. (2014), Hatami-Marbini et al. (2017), Ureña et al. (2019), Zhang et al. (2019), Kao et al. (2014) and the references therein.

The MPI computation using DEA with uncertain data has not been studied widely in the literature. For instance, Emrouznejad et al. (2011) studied the overall profit MPI using DEA with fuzzy and interval data. They extended the model (39) of Asmild et al. (2007) and proposed two methods for measuring the overall profit MPI when the input, output, and price vectors are fuzzy or vary over intervals (see Emrouznejad et al. (2011), models (3a) and (3b)). To the best of our knowledge, to compute the overall profit MPI of each DMU, the profit efficiency at time period t[(t+1) must be computed using the technology and input-output prices at time period t+1](t) (see (Tohidi et al. 2010; Tohidi et al. 2014). However, in Emrouznejad et al.’s (2011) method, the input-output prices in periods t and t+1 are used simultaneously, meaning the results are not reasonable (see subsection 2.2. for details). As such, this paper overcomes the shortfall of Emrouznejad et al.’s model (3b) (Emrouznejad et al. 2011). Park (2001) introduced an approach to deal with IDEA involving variable input and output. He considered the multiplier and envelopment IDEA models (Cooper et al. 1999; Lee et al. 2002) and clarified the relationships between them. These models yield an upper and a lower bound on efficiency, respectively. Mostafaee and Saljooghi (2010) extended the classical cost efficiency models to include data uncertainty. However, Fang and Li (2012) showed that Mostafaee and Saljooghi’s (2010) approach had some drawbacks. Then, Fang and Li (2013) extended Park’s approach and presented an alternative IDEA method to calculate an upper and a lower bound of cost efficiency measurement in the presence of imprecise price inputs. Based on the studies of Park (2001) and Emrouznejad et al. (2011), this paper introduces alternative methods for measuring the overall profit MPI when the input, output, and input-output prices are uncertain and also measures the lower and upper bounds of overall profit MPIs. We show that the upper bound of the overall profit efficiency is obtained by incorporating uncertain data as interval data directly into the overall profit efficiency models. In addition, the lower bound of the overall profit efficiency is achieved by incorporating the same uncertain data as weight restrictions into a CR-DEA model. The main contributions of this paper are as follows: (a) we calculate the overall profit MPI assuming that input, output, and input-output prices are imprecise; (b) we characterized these imprecise data with interval methods; (c) we propose models to measure the overall profit efficiency in adjacent periods, which has a reasonable interpretation (see model (4)); (d) we establish new models to compute the upper bounds for the profit efficiency measures; (e) we extend the model using CR-DEA; and (f) we demonstrate the practical aspects of our model using a numerical example.

The remainder of this paper is organized as follows. “Overall profit efficiency and MPIs” section presents an overview of overall profit efficiency and Malmquist indices. “Main results” section proposes models to calculate the lower and upper bounds of the profit efficiency of each DMU within the period and for adjusted periods. In “Computational aspects” section, we develop new methods to calculate the upper bounds of the overall profit efficiency of each DMU. A numerical example is also provided in “Computational aspects” section. Finally, “Conclusions” section concludes the paper.

Overall profit efficiency and MPIs

MPIs measure the productivity change of a DMU between two different time periods. Färe et al. (1994, 1992) developed an input based non-parametric Malmquist index using DEA. This DEA-based Malmquist productivity can be extended to measure the productivity changes of DMUs over time. Here, we discuss the overall profit efficiency and overall profit MPIs.

Overall profit efficiency

Consider a set of n DMUs associated with m inputs and s outputs. Particularly, DMU_j(j∈J=1,...,n) consumes amount x_ij of input i and produces amount y_rj of output r. Let X_j=(x_1j,...,x_mj), where X_j≥0&X_j≠0 and Y_j=(y_1j,...,y_rj) and where Y_j≥0&Y_j≠0. In addition, c and r are the input and output price vectors, respectively, for DMU_j(j∈J=1,...,n), where c≥0 and r≥0,c≠0, and r≠0. Asmild (2007) presented the following model for measuring the overall profit efficiency of DMU_o=(x_o,y_o),(o=1,...,n):

$$ \begin{array}{rlllc} \max&\ \frac{r_{o}^{T}y}{r_{o}^{T}y_{o}}-\frac{c_{o}^{T}x}{c_{o}^{T}x_{o}}\\ s.t.&-\sum_{j\in J}\lambda_{j}y_{j}+y\leq0\\ &\sum_{j\in J}\lambda_{j}x_{j}-x\leq0\\ &\sum_{j\in J}\lambda_{j}=1,\\ &\lambda_{j}\geq0\\ \end{array} $$

(1)

where x, y, and λ_j,j∈J are variables and the objective function of this linear program is to maximize the difference between the revenue and cost ratios for a given price vector $p^{T}_{o}=\left (c^{T}_{o}, r^{T}_{o}\right)$ for the DMU_o under assessment. Superscript T stands for a transposed vector.

The following definition and theorem refer to (Toloo et al. 2008).

Definition 1

DMU_o is overall profit efficient if in model (1), $\frac {r_{o}^{T}y^{*}}{r_{o}^{T}y_{o}}-\frac {c_{o}^{T}x^{*}}{c_{o}^{T}x_{o}}=0$.

Theorem 1

For every optimal solution (x^∗,y^∗,λ^∗) of (1), we have $\frac {r_{o}^{T}y^{*}}{r_{o}^{T}y_{o}}-\frac {c_{o}^{T}x^{*}}{c_{o}^{T}x_{o}}\geq 0$.

Overall profit MPIs

Emrouznejad et al. (2011) used the following model to measure the overall profit efficiency in the adjacent period:

$$ \begin{array}{rlllc} D_{o}^{p}\left(x_{o}^{q}, y_{o}^{q}|p,q=t, t+1, p\neq q\right)=&\max&\ \varphi-\theta\\ &s.t.&\varphi\left[\left(r_{j}^{p}\right)^{T}y_{0}^{p}\right]\leq \left(r_{j}^{q}\right)^{T}Y^{q}\lambda,&\forall j,\\ &&\theta\left[\left(c_{j}^{p}\right)^{T}x_{0}^{p}\right]\leq \left(c_{j}^{q}\right)^{T}X^{q}\lambda,&\forall j,\\ &&\lambda\geq0,\\ \end{array} $$

(2)

where X^p and Y^p are the input and output matrices of the observed data for period p, respectively. To the best of our knowledge, to compute the overall profit MPI of DMU_o, the profit efficiency of $DMU^{p}_{o}=\left (x_{o}^{p}, y_{o}^{p}\right)$ must be computed using the technology and input-output prices at period q, (p,q=t,t+1,p≠q) (see Tohidi et al. (2010; 2014). However, in (2), the input-output prices in period p and q are used simultaneously. To overcome this shortfall, this paper introduces variable returns to scale overall profit efficiency in the within and adjacent periods as (3) and (4), respectively:

$$ \begin{array}{rlllc} B_{o}^{p}\left(x_{o}^{p}, y_{o}^{p}|p=t, t+1\right)=&\max&\ \frac{\left(r_{o}^{p}\right)^{T}y}{\left(r_{o}^{p}\right)^{T}y^{p}_{o}}-\frac{\left(c_{o}^{p}\right)^{T}x}{(c_{o}^{p})^{T}x^{p}_{o}}\\ &s.t.&-\sum_{j\in J}\lambda_{j}y^{p}_{j}+y\leq0\\ &&\sum_{j\in J}\lambda_{j}x^{p}_{j}-x\leq0\\ &&\sum_{j\in J}\lambda_{j}=1,\\ &&\lambda\geq0\\ \end{array} $$

(3)

$$ \begin{array}{rlllc} D_{o}^{q}\left(x_{o}^{p}, y_{o}^{p}|p,q=t, t+1, p\neq q\right)=&\max&\ \frac{\left(r_{o}^{q}\right)^{T}y}{\left(r_{o}^{q}\right)^{T}y^{p}_{o}}-\frac{\left(c_{o}^{q}\right)^{T}x}{\left(c_{o}^{q}\right)^{T}x^{p}_{o}}\\ &s.t.&-\sum_{j\in J}\lambda_{j}y^{q}_{j}+y\leq0\\ &&\sum_{j\in J}\lambda_{j}x^{q}_{j}-x\leq0\\ &&\sum_{j\in J}\lambda_{j}=1,\\ &&\lambda\geq0\\ \end{array} $$

(4)

where $x_{j}^{p}$ and $y_{j}^{p}$ are the input and output of DMU_j in period p, respectively.

Models (3) and (4) have clear interpretations. Model (3) calculates the profit efficiency of $DMU^{p}_{o}$ using the technology and input-output prices in period p and model (4) calculates the profit efficiency of $DMU^{p}_{o}$ using the technology and input-output prices in period q, (p,q=t,t+1,p≠q).

The following definitions and theorem refer to (Emrouznejad et al. 2011).

Theorem 2

For every optimal solution (x^∗,y^∗,λ^∗) of (3), we have $\frac {\left (r_{o}^{p}\right)^{T}y^{*}}{\left (r_{o}^{p}\right)^{T}y^{p}_{o}}-\frac {\left (c_{o}^{p}\right)^{T}x^{*}}{\left (c_{o}^{p}\right)^{T}x^{p}_{o}}\geq 0$.

Proof

Model (3) has a feasible solution λ_o=1,λ_j=0,j≠o. Hence, the optimal objective, denoted by $\frac {\left (r_{o}^{p}\right)^{T}y^{*}}{\left (r_{o}^{p}\right)^{T}y^{p}_{o}}-\frac {\left (c_{o}^{p}\right)^{T}x^{*}}{\left (c_{o}^{p}\right)^{T}x^{p}_{o}}$, is greater than or equal to 0, i.e., $\frac {\left (r_{o}^{p}\right)^{T}y^{*}}{\left (r_{o}^{p}\right)^{T}y^{p}_{o}}-\frac {\left (c_{o}^{p}\right)^{T}x^{*}}{\left (c_{o}^{p}\right)^{T}x^{p}_{o}}\geq 0.$ □

Remarks 1

The objective function values for model (4) can be less than or equal to zero.

Definition 2

DMU_o is overall efficient if $D_{o}^{t+1}\left (x_{o}^{t+1}, y_{o}^{t+1}\right)=0$ and $D_{o}^{t}\left (x_{o}^{t}, y_{o}^{t}\right)=0$.

Definition 3

The efficiency scores of models (3) and (4) are respectively computed as follows:

• If $\frac {\left (r_{o}^{p}\right)^{T}y^{*}}{\left (r_{o}^{p}\right)^{T}y^{p}_{o}}-\frac {\left (c_{o}^{p}\right)^{T}x^{*}}{\left (c_{o}^{p}\right)^{T}x^{p}_{o}}\geq 0$, then $\rho =\frac {1}{1+\frac {\left (r_{o}^{p}\right)^{T}y^{*}}{\left (r_{o}^{p}\right)^{T}y^{p}_{o}}-\frac {\left (c_{o}^{p}\right)^{T}x^{*}}{\left (c_{o}^{p}\right)^{T}x^{p}_{o}}}$.

• If $\frac {\left (r_{o}^{q}\right)^{T}y^{*}}{\left (r_{o}^{q}\right)^{T}y^{p}_{o}}-\frac {\left (c_{o}^{q}\right)^{T}x^{*}}{\left (c_{o}^{q}\right)^{T}x^{p}_{o}}\leq 0$, then $\rho =1+\frac {\left (r_{o}^{q}\right)^{T}y^{*}}{\left (r_{o}^{q}\right)^{T}y^{p}_{o}}-\frac {\left (c_{o}^{q}\right)^{T}x^{*}}{\left (c_{o}^{q}\right)^{T}x^{p}_{o}}$.

Obviously, if ρ=1DMU_o is efficient and if ρ<1,DMU_o is inefficient.

Definition 4

The overall profit MPI of DMU_o is defined as follows:

$$M_{o}=\sqrt{\frac{\rho_{o}^{t}\left(x_{o}^{t+1},y_{o}^{t+1}\right)}{\rho_{o}^{t}\left(x_{o}^{t},y_{o}^{t}\right)}\times \frac{\rho_{o}^{t+1}\left(x_{o}^{t+1},y_{o}^{t+1}\right)}{\rho_{o}^{t+1}\left(x_{o}^{t},y_{o}^{t}\right)}}.$$

Therefore, the following three conditions hold:

• M_o>1, increase productivity and observe progress;

• M_o<1, decrease productivity and observe regress; and

• M_o=1, no change in productivity at time t+1 compared to t.

Main results

Here, we consider the overall profit efficiency and overall profit MPI of DMU_o,o=1,...,n when input, output, and input-output prices are uncertain and also define an interval for the overall profit MPI of DMU_o. We reiterate that there are n DMUs under consideration.

Assume that $\left [x^{pL}_{ij}, x^{pU}_{ij}\right ]$ and $\left [y^{pL}_{kj}, y^{pU}_{kj}\right ]$ are the intervals of input i and output k of DMU_j,(j∈J) in period p, respectively. Additionally, $\left [c^{pL}_{io}, c^{pU}_{io}\right ]$, and $\left [r^{pL}_{ko}, r^{pU}_{ko}\right ]$ are the intervals of the input-output prices of input i and output k of DMU_o,o=1,...,n in period p, respectively. Models (3) and (4) can be extended to the overall profit efficiency models (5) and (6) with data uncertainty, respectively:

$$ \begin{array}{llll} {Within-period\ time} & & & \\ B_{o}^{p}\left(x_{o}^{p}, y_{o}^{p}|p=t, t+1\right)=&\max&\ \frac{\left(r_{o}^{p}\right)^{T}y}{\left(r_{o}^{p}\right)^{T}y^{p}_{o}}-\frac{\left(c_{o}^{p}\right)^{T}x}{\left(c_{o}^{p}\right)^{T}x^{p}_{o}}\\ &s.t.&-\sum_{j\in J}\lambda_{j}y^{p}_{j}+y\leq0\\ &&\sum_{j\in J}\lambda_{j}x^{p}_{j}-x\leq0\\ &&\sum_{j\in J}\lambda_{j}=1\\ &&c^{p}_{io}\in\left[c^{pL}_{io}, c^{pU}_{io}\right],&i=1,...,m\\ &&r^{p}_{ko}\in\left[r^{pL}_{ko}, r^{pU}_{ko}\right],&k=1,...,s\\ &&x^{p}_{ij}\in\left[x^{pL}_{ij}, x^{pU}_{ij}\right],&i=1,...,m\\ &&y^{p}_{kj}\in\left[y^{pL}_{kj}, y^{pU}_{kj}\right],&k=1,...,s\\ &&\lambda_{j}\geq0,&j\in J.\\ \end{array} $$

(5)

$$ \begin{array}{llllc} Adjacent-period time & \\ D_{o}^{q}\left(x_{o}^{p}, y_{o}^{p}|p,q=t, t+1, p\neq q\right)=&\max&\ \frac{\left(r_{o}^{q}\right)^{T}y}{\left(r_{o}^{q}\right)^{T}y^{p}_{o}}-\frac{\left(c_{o}^{q}\right)^{T}x}{\left(c_{o}^{q}\right)^{T}x^{p}_{o}}\\ &s.t.&-\sum_{j\in J}\lambda_{j}y^{q}_{j}+y\leq0\\ &&\sum_{j\in J}\lambda_{j}x^{q}_{j}-x\leq0\\ &&\sum_{j\in J}\lambda_{j}=1\\ &&c^{q}_{io}\in\left[c^{qL}_{io}, c^{qU}_{io}\right],&i=1,...,m\\ &&r^{q}_{ko}\in\left[r^{qL}_{ko}, r^{qU}_{ko}\right],&k=1,...,s\\ &&x^{q}_{ij}\in\left[x^{qL}_{ij}, x^{qU}_{ij}\right],&i=1,...,m\\ &&y^{q}_{kj}\in\left[y^{qL}_{kj}, y^{qU}_{kj}\right],&k=1,...,s\\ &&x^{p}_{io}\in\left[x^{pL}_{io}, x^{pU}_{io}\right],&i=1,...,m\\ &&y^{p}_{ko}\in\left[y^{pL}_{ko}, y^{pU}_{ko}\right],&k=1,...,s.\\ &&\lambda_{j}\geq0,&j\in J\\ \end{array} $$

(6)

It can be observed that models (5) and (6) are nonlinear programming programs because of data uncertainty.

Of particular importance is how to solve the newly constructed profit efficiency models with data uncertainty in (5) and (6). To illustrate these issues, we introduce the following definitions, which are similar to those of Park (2001).

Definition 5

(Potential profit efficiency in the within-period time) The DMU_o to be evaluated is potentially profit efficient in the within-period if and only if there exists at least one set of prices $c^{p}_{o}\in \left [c^{pL}_{o}, c^{pU}_{o}\right ]$ and $r^{p}_{o}\in \left [r^{pL}_{o}, r^{pU}_{o}\right ]$ and at least one set of input-output data satisfying $x^{p}_{ij}\in \left [x^{pL}_{ij}, x^{pU}_{ij}\right ]$ and $y^{p}_{kj}\in \left [y^{pL}_{kj}, y^{pU}_{kj}\right ] (j\in J)$, so that $B^{p*}_{o}=0$¹ in model (5).

Definition 6

(Perfect profit efficiency in the within-period time) The DMU_o to be evaluated is perfectly profit efficient in the within-period if and only if, for all $c^{p}_{o}\in \left [c^{pL}_{o}, c^{pU}_{o}\right ]$ and $r^{p}_{o}\in \left [r^{pL}_{o}, r^{pU}_{o}\right ]$ and all input-output data, $x^{p}_{ij}\in \left [x^{pL}_{ij}, x^{pU}_{ij}\right ]$ and $y^{p}_{kj}\in \left [y^{pL}_{kj}, y^{pU}_{kj}\right ] (j\in J), B^{p*}_{o}=0$ are satisfied in model (5).

Definition 7

(Potential profit efficiency in the adjacent period) The DMU_o to be evaluated is potentially profit efficient in the adjacent period if and only if there exists at least one set of prices $c^{q}_{o}\in \left [c^{qL}_{o}, c^{qU}_{o}\right ]$ and $r^{q}_{o}\in \left [r^{qL}_{o}, r^{qU}_{o}\right ]$ and at least one set of input-output data satisfying $x^{q}_{ij}\in \left [x^{qL}_{ij}, x^{qU}_{ij}\right ], y^{q}_{kj}\in \left [y^{qL}_{kj}, y^{qU}_{kj}\right ] (j\in J), x^{p}_{io}\in \left [x^{pL}_{io}, x^{pU}_{io}\right ]$ and $y^{p}_{ko}\in \left [y^{pL}_{ko}, y^{pU}_{ko}\right ] (p, q=t, t+1, p\neq q)$, so that $D^{q*}_{o}=0$ in model (6).

Definition 8

(Perfect profit efficiency in the adjacent period) The DMU_o to be evaluated is perfectly profit efficient in the adjacent-period time if and only if, for all $c^{q}_{o}\in \left [c^{qL}_{o}, c^{qU}_{o}\right ]$ and $r^{q}_{o}\in \left [r^{qL}_{o}, r^{qU}_{o}\right ]$ and all input-output data, $x^{q}_{ij}\in \left [x^{qL}_{ij}, x^{qU}_{ij}\right ], y^{q}_{kj}\in \left [y^{qL}_{kj}, y^{qU}_{kj}\right ] (j\in J), x^{p}_{io}\in \left [x^{pL}_{io}, x^{pU}_{io}\right ]$ and $y^{p}_{ko}\in \left [y^{pL}_{ko}, y^{pU}_{ko}\right ] (p, q=t, t+1, p\neq q)$ are satisfied so that $D^{q*}_{o}=0$ in model (6).

In definitions 5 and 7, the profit efficiency of DMU_o is measured for some data, while definitions 6 and 8 refer to the profit efficiency of DMU_o for all data. Therefore, perfect profit efficiency is measured in a more rigid manner than potential profit efficiency. In the spirit of Park (2001), we can represent these definitions using the following mathematical formulations, where term UPEW-S (UPEW-P) refers to the uncertain profit efficiency of $DMU_{o}^{p}=\left (x_{o}^{p}, y_{o}^{p}\right)$ with the technology and prices at time p, the within period, for some (for perfect (all)). Additionally, term UPEA-S (UPEA-P) refers to uncertain profit efficiency of $DMU_{o}^{p}=\left (x_{o}^{p}, y_{o}^{p}\right)$ with technology and prices at time q, the adjacent period, for some (for perfect (all)) (p,q=t,t+1, p≠q):

$$ \begin{array}{rlclc} &&\text{The UPEW-S model:}\\ \overline{B}_{o}^{p}\left(x_{o}^{p}, y_{o}^{p}|p=t, t+1\right)=&\max&\ \frac{\left(r_{o}^{p}\right)^{T}y}{\left(r_{o}^{p}\right)^{T}y^{p}_{o}}-\frac{\left(c_{o}^{p}\right)^{T}x}{\left(c_{o}^{p}\right)^{T}x^{p}_{o}}\\ &s.t.&-\sum_{j\in J}\lambda_{j}y^{p}_{j}+y\leq0\\ &&\sum_{j\in J}\lambda_{j}x^{p}_{j}-x\leq0\\ &&\sum_{j\in J}\lambda_{j}=1\\ &&\text{for some}\{c^{p}_{io}\in\left[c^{pL}_{io}, c^{pU}_{io}\right],&i=1,...,m\}\\ &&\text{for some}\{r^{p}_{ko}\in\left[r^{pL}_{ko}, r^{pU}_{ko}\right],&k=1,...,s\}\\ &&\text{for some}\{x^{p}_{ij}\in\left[x^{pL}_{ij}, x^{pU}_{ij}\right],&i=1,...,m\}\\ &&\text{for some}\{y^{p}_{kj}\in\left[y^{pL}_{kj}, y^{pU}_{kj}\right],&k=1,...,s\}\\ &&\lambda_{j}\geq0.\\ \end{array} $$

(7)

$$ \begin{array}{rlclc} &&\text{The UPEW-P model:}\\ &&\text{Model (7) with } \underline{B}_{o}^{p} \text{ in place of } \overline{B}_{o}^{p} \text{ and }\prime\prime \text{ for all}\prime\prime\\ &&\text{in place of }\prime\prime \text{ for some}.\prime\prime\\ \end{array} $$

(8)

$$ \begin{array}{rlclc} &&\text{The UPEA-S model:}\\ \overline{D}_{o}^{q}\left(x_{o}^{p}, y_{o}^{p}|p,q=t, t+1, p\neq q\right)=&\max&\ \frac{\left(r_{o}^{q}\right)^{T}y}{\left(r_{o}^{q}\right)^{T}y^{p}_{o}}-\frac{\left(c_{o}^{q}\right)^{T}x}{\left(c_{o}^{q}\right)^{T}x^{p}_{o}}\\ &s.t.&-\sum_{j\in J}\lambda_{j}y^{q}_{j}+y\leq0\\ &&\sum_{j\in J}\lambda_{j}x^{q}_{j}-x\leq0\\ &&\sum_{j\in J}\lambda_{j}=1\\ &&\text{for some } \left\{c^{q}_{io}\in[c^{qL}_{io}, c^{qU}_{io}],\quad i=1,...,m\right\}\\ &&\text{for some } \left\{r^{q}_{ko}\in [r^{qL}_{ko}, r^{qU}_{ko}],\quad k=1,...,s\right\}\\ &&\text{for some } \left\{x^{q}_{ij}\in[x^{qL}_{ij}, x^{qU}_{ij}],\quad i=1,...,m\right\}\\ &&\text{for some } \left\{y^{q}_{kj}\in [y^{qL}_{kj}, y^{qU}_{kj}],\quad k=1,...,s\right\}\\ &&\text{for some } \left\{x^{p}_{io}\in[x^{pL}_{io}, x^{pU}_{io}],\quad i=1,...,m\right\}\\ &&\text{for some } \left\{y^{p}_{ko}\in [y^{pL}_{ko}, y^{pU}_{ko}],\quad k=1,...,s\right\}\\ &&\lambda_{j}\geq0.\\ \end{array} $$

(9)

$$ \begin{array}{rlclc} &&\text{The UPEA-P model:}\\ &&\text{Model (9) with } \underline{D}^{q}_{o} \text{ in place of } \overline{D}_{o}^{q} \text{ and }\prime\prime \text{for all}\prime\prime\\ &&\text{in place of }\prime\prime \text{for some}.\prime\prime\\ \end{array} $$

(10)

Clearly, $\overline {B}_{o}^{p}\geq \underline {B}_{o}^{p}$ ($\overline {D}_{o}^{q}\geq \underline {D}_{o}^{q}$) because the feasible region of model (8) (10) is always contained within the feasible region of model (7) (9).

Using models (7) and (8), we can obtain the interval of profit efficiency of DMU_o in the within-period as $\left [\underline {B}_{o}^{p}, \overline {B}_{o}^{p}\right ]$. Additionally, by models (9) and (10), the interval of profit efficiency of DMU_o in the adjacent period can be obtained as $\left [\underline {D}_{o}^{q}, \overline {D}_{o}^{q}\right ]$. $\underline {B}_{o}^{p} \left (\underline {D}_{o}^{q}\right)$ is the lower bound of the interval overall profit efficiency of DMU_o from the pessimistic viewpoint in the within period (adjacent period) and $\overline {B}_{o}^{p} \left (\overline {D}_{o}^{q}\right)$ is the upper bound of the interval overall profit efficiency of DMU_o from the optimistic viewpoint in the within period (adjacent period).

Remarks 2

It is clear that model (5) is equivalent to the UPEW-S model (7) and model (6) is equivalent to the UPEA-S model (9).

Because of the notion of maximization “for some” and “for all” in the permissible data, the UPEW-S (7), UPEW-P (8), UPEA-S (9), and UPEA-P models (10) are equivalent to the two-level mathematical programs (11), (12), (13), and (14), respectively:

$$ \begin{array}{llllc} \overline{B}_{o}^{p}=\max&\max&\ \frac{\left(r_{o}^{p}\right)^{T}y}{\left(r_{o}^{p}\right)^{T}y^{p}_{o}}-\frac{\left(c_{o}^{p}\right)^{T}x}{\left(c_{o}^{p}\right)^{T}x^{p}_{o}}\\ c^{p}_{io}\in\left[c^{pL}_{io}, c^{pU}_{io}\right]\\ r^{p}_{ko}\in \left[r^{pL}_{ko}, r^{pU}_{ko}\right]\\ x^{p}_{ij}\in\left[x^{pL}_{ij}, x^{pU}_{ij}\right]\\ y^{p}_{kj}\in\left[y^{pL}_{kj}, y^{pU}_{kj}\right]\\ &s.t.&-\sum_{j\in J}\lambda_{j}y^{p}_{j}+y\leq0\\ &&\sum_{j\in J}\lambda_{j}x^{p}_{j}-x\leq0\\ &&\sum_{j\in J}\lambda_{j}=1\\ &&\lambda_{j}\geq0.\\ \end{array} $$

(11)

$$ \begin{array}{rlclc} &&\text{Model (11) but with} \prime\prime \underline{B}_{o}^{p}=\text{min}\prime\prime \text{in place of }\prime\prime\overline{B}_{o}^{p}=\text{max}\prime\prime.\\ \end{array} $$

(12)

$$ \begin{array}{llllc} \overline{D}_{o}^{p}=\max&\max&\ \frac{\left(r_{o}^{q}\right)^{T}y}{\left(r_{o}^{q}\right)^{T}y^{p}_{o}}-\frac{\left(c_{o}^{q}\right)^{T}x}{\left(c_{o}^{q}\right)^{T}x^{p}_{o}}\\ c^{q}_{io}\in\left[c^{qL}_{io}, c^{qU}_{io}\right]\\ r^{q}_{ko}\in \left[r^{qL}_{ko}, r^{qU}_{ko}\right]\\ x^{q}_{ij}\in\left[x^{qL}_{ij}, x^{qU}_{ij}\right]\\ y^{q}_{kj}\in \left[y^{qL}_{kj}, y^{qU}_{kj}\right]\\ x^{p}_{io}\in\left[x^{pL}_{io}, x^{pU}_{io}\right]\\ y^{p}_{ko}\in \left[y^{pL}_{ko}, y^{pU}_{ko}\right]\\ &s.t.&-\sum_{j\in J}\lambda_{j}y^{q}_{j}+y\leq0\\ &&\sum_{j\in J}\lambda_{j}x^{q}_{j}-x\leq0\\ &&\sum_{j\in J}\lambda_{j}=1\\ &&\lambda_{j}\geq0.\\ \end{array} $$

(13)

$$ \begin{array}{rlclc} &&\text{Model (13) but with } \prime\prime\underline{D}_{o}^{p}=\text{min}\prime\prime \text{ in place of } \prime\prime\overline{D}_{o}^{p}=\text{max}\prime\prime. \end{array} $$

(14)

In model (11), the inner program calculates the overall profit efficiency for each given set of $\left (x^{p}_{o}, y^{p}_{o}\right)$ for a price vector $\left (r_{o}^{p}, c_{o}^{p}\right)$ defined in the outer program, using the technology of period p, while the outer program determines the set of $\left (x^{p}_{o}, y^{p}_{o}\right)$ and price vector $\left (r_{o}^{p}, c_{o}^{p}\right)$ that generate the highest overall profit efficiency. Additionally, in model (13), the inner program calculates the overall profit efficiency for each given set of $\left (x^{p}_{o}, y^{p}_{o}\right)$ for a given price vector $\left (r_{o}^{q}, c_{o}^{q}\right)$ using the technology of period q (p,q=t,t+1,p≠q), defined in the outer program, while the outer program determines the set of $\left (x^{p}_{o}, y^{p}_{o}\right)$ and price vector $\left (r_{o}^{q}, c_{o}^{q}\right)$ that generate the highest overall profit efficiency. A similar explanation can be provided for models (12) and (14).

By duality, models (11)-(14) are equivalent to the following models:

$$ \begin{array}{llllc} \overline{B}_{o}^{p}=\max&\min&\ \mu_{o}\\ c^{p}_{io}\in\left[c^{pL}_{io}, c^{pU}_{io}\right]\\ r^{p}_{ko}\in \left[r^{pL}_{ko}, r^{pU}_{ko}\right]\\ x^{p}_{ij}\in\left[x^{pL}_{ij}, x^{pU}_{ij}\right]\\ y^{p}_{kj}\in \left[y^{pL}_{kj}, y^{pU}_{kj}\right]\\ &s.t.&\sum_{k=1}^{s}\mu^{p}_{k}y^{p}_{kj}-\sum_{i=1}^{m}v^{p}_{i}x^{p}_{ij}+\mu_{o}\geq0,&j=1,...n\\ &&\mu^{p}_{k}=\frac{r^{p}_{ko}}{\left(r^{p}_{o}\right)^{T}y^{p}_{o}},&k=1,...,s&\\ &&v^{p}_{i}=\frac{c^{p}_{io}}{\left(c^{p}_{o}\right)^{T}x^{p}_{o}},&i=1,...,m&\\ &&\mu^{p}_{k}\geq0,&k=1,...,s\\ &&v^{p}_{i}\geq0,&i=1,...,m\\ &&\mu_{0}&free,\\ \end{array} $$

(15)

$$ \begin{array}{rlclc} &&\text{Model (15) but with }\prime\prime\underline{B}_{o}^{p}=\text{min}\prime\prime \text {in place of } \prime\prime\overline{B}_{o}^{p}=\text{max}\prime\prime.\\ \end{array} $$

(16)

$$ \begin{array}{llllc} \overline{D}_{o}^{p}=\max&\min&\ \mu_{o}\\ c^{q}_{io}\in\left[c^{qL}_{io}, c^{qU}_{io}\right]\\ r^{q}_{ko}\in \left[r^{qL}_{ko}, r^{qU}_{ko}\right]\\ x^{q}_{ij}\in\left[x^{qL}_{ij}, x^{qU}_{ij}\right]\\ y^{q}_{kj}\in \left[y^{qL}_{kj}, y^{qU}_{kj}\right]\\ x^{p}_{io}\in\left[x^{pL}_{io}, x^{pU}_{io}\right]\\ y^{p}_{ko}\in \left[y^{pL}_{ko}, y^{pU}_{ko}\right]\\ &s.t.&\sum_{k=1}^{s}\mu^{q}_{k}y^{q}_{kj}-\sum_{i=1}^{m}v^{q}_{i}x^{q}_{ij}+\mu_{o}\geq0,&j=1,...n\\ &&\mu^{q}_{k}=\frac{r^{q}_{ko}}{\left(r^{q}_{o}\right)^{T}y^{p}_{o}},&k=1,...,s&\\ &&v^{q}_{i}=\frac{c^{q}_{io}}{\left(c^{q}_{o}\right)^{T}x^{p}_{o}},&i=1,...,m&\\ &&\mu^{q}_{k}\geq0,&k=1,...,s\\ &&v^{q}_{i}\geq0,&i=1,...,m\\ &&\mu_{0}&free.\\ \end{array} $$

(17)

$$ \begin{array}{rlclc} &&\text{Model (17) but with } \prime\prime\underline{D}_{o}^{p}=\text{min}\prime\prime \text{ in place of } \prime\prime\overline{D}_{o}^{p}=\text{max}\prime\prime. \end{array} $$

(18)

First, we proceed to models (16) and (18). Their inner and outer programs have the same objective of minimization. Therefore, they can be combined into a one-level model by considering all constraints of the two programs simultaneously. The one-level models equivalent to (16) and (18) are (19) and (20), respectively:

$$ \begin{array}{llllc} \underline{B}_{o}^{p}=\min&\ \mu_{o}\\ &s.t.&\sum_{k=1}^{s}\mu^{p}_{k}y^{p}_{kj}-\sum_{i=1}^{m}v^{p}_{i}x^{p}_{ij}+\mu_{o}\geq0,&j=1,...n\\ &&\mu^{p}_{k}=\frac{r^{p}_{ko}}{\left(r^{p}_{o}\right)^{T}y^{p}_{o}},&k=1,...,s&\\ &&v^{p}_{i}=\frac{c^{p}_{io}}{\left(c^{p}_{o}\right)^{T}x^{p}_{o}},&i=1,...,m&\\ &&c^{p}_{io}\in\left[c^{pL}_{io}, c^{pU}_{io}\right]\\ &&r^{p}_{ko}\in \left[r^{pL}_{ko}, r^{pU}_{ko}\right]\\ &&x^{p}_{ij}\in\left[x^{pL}_{ij}, x^{pU}_{ij}\right]\\ &&y^{p}_{kj}\in \left[y^{pL}_{kj}, y^{pU}_{kj}\right]\\ &&\mu^{p}_{k}\geq0,&k=1,...,s\\ &&v^{p}_{i}\geq0,&i=1,...,m\\ &&\mu_{o}&free\\ &&\lambda_{j}\geq0,\\ \end{array} $$

(19)

$$ \begin{array}{llllc} \underline{D}_{o}^{p}=\min& \mu_{o}\\ &s.t.&\sum_{k=1}^{s}\mu^{q}_{k}y^{q}_{kj}-\sum_{i=1}^{m}v^{q}_{i}x^{q}_{ij}+\mu_{o}\geq0,&j=1,...n\\ &&\mu^{q}_{k}=\frac{r^{q}_{ko}}{\left(r^{q}_{o}\right)^{T}y^{p}_{o}},&k=1,...,s&\\ &&v^{q}_{i}=\frac{c^{q}_{io}}{(c^{q}_{o})^{T}x^{p}_{o}},&i=1,...,m&\\ &&c^{q}_{io}\in\left[c^{qL}_{io}, c^{qU}_{io}\right]\\ &&r^{q}_{ko}\in \left[r^{qL}_{ko}, r^{qU}_{ko}\right]\\ &&x^{q}_{ij}\in\left[x^{qL}_{ij}, x^{qU}_{ij}\right]\\ &&y^{q}_{kj}\in \left[y^{qL}_{kj}, y^{qU}_{kj}\right]\\ &&x^{p}_{io}\in\left[x^{pL}_{io}, x^{pU}_{io}\right]\\ &&y^{p}_{ko}\in \left[y^{pL}_{ko}, y^{pU}_{ko}\right]\\ &&\mu^{q}_{k}\geq0,&k=1,...,s\\ &&v^{q}_{i}\geq0,&i=1,...,m\\ &&\mu_{o}&free\\ &&\lambda_{j}\geq0.\\ \end{array} $$

(20)

Evidently the above models (19) and (20) are nonlinear programming problems and thus difficult to solve. To linearize model (19), we introduce variables z^p and τ^p, defined by:

$z^{p}=\frac {1}{\left (c^{p}_{o}\right)^{T}x^{p}_{o}}$,

$\tau ^{p}=\frac {1}{\left (r^{p}_{o}\right)^{T}y^{p}_{o}}$,

so that

$v^{p}_{i}=c^{p}_{io}z^{p}\Longleftrightarrow c^{pL}_{io}z^{p}\leq v^{p}_{i}\leq c^{pU}_{io}z^{p}$,

$\mu ^{p}_{k}=r^{p}_{ko}\tau ^{p}\Longleftrightarrow r^{pL}_{ko}\tau ^{p}\leq \mu ^{p}_{k} \leq r^{pU}_{ko}\tau ^{p}$,

$\sum _{k=1}^{s}r^{p}_{ko}\tau ^{p}y^{p}_{ko}=1\Longleftrightarrow \sum _{k=1}^{s}\mu ^{p}_{k}y^{p}_{ko}=1$,

$\sum _{i=1}^{m}c^{p}_{io}z^{p}x^{p}_{io}=1\Longleftrightarrow \sum _{i=1}^{m}v^{p}_{i}x^{p}_{io}=1$.

Similarly, to the linearization of model (20), we introduce variables z^q and τ^q, defined by:

$z^{q}=\frac {1}{\left (c^{q}_{o}\right)^{T}x^{p}_{o}}$,

$\tau ^{q}=\frac {1}{\left (r^{q}_{o}\right)^{T}y^{p}_{o}}$,

so that

$v^{q}_{i}=c^{q}_{io}z^{q}\Longleftrightarrow c^{qL}_{io}z^{q}\leq v^{q}_{i}\leq c^{qU}_{io}z^{q}$,

$\mu ^{q}_{k}=r^{q}_{ko}\tau ^{q}\Longleftrightarrow r^{qL}_{ko}\tau ^{q}\leq \mu ^{q}_{k} \leq r^{qU}_{ko}\tau ^{q}$,

$\sum _{k=1}^{s}r^{q}_{ko}\tau ^{q}y^{p}_{ko}=1\Longleftrightarrow \sum _{k=1}^{s}\mu ^{q}_{k}y^{p}_{ko}=1$,

$\sum _{i=1}^{m}c^{q}_{io}z^{q}x^{p}_{io}=1\Longleftrightarrow \sum _{i=1}^{m}v^{q}_{i}x^{p}_{io}=1$,

where p,q=t,t+1,p≠q.

Using the above variable alterations, models (19) and (20) can be converted into the following programming problems, whose optimal objective values coincide with those of (19) and (20), respectively:

$$ \begin{array}{llllc} \underline{B}_{o}^{p}=\min&\ \mu_{o}\\ &s.t.&\sum_{k=1}^{s}\mu^{p}_{k}y^{p}_{kj}-\sum_{i=1}^{m}v^{p}_{i}x^{p}_{ij}+\mu_{o}\geq0,&j=1,...n\\ &&\sum_{k=1}^{s}\mu^{p}_{k}y^{p}_{ko}=1\\ &&\sum_{i=1}^{m}v^{p}_{i}x^{p}_{io}=1\\ &&c^{pL}_{io}z^{p}\leq v^{p}_{i}\leq c^{pU}_{io}z^{p}\\ &&r^{pL}_{ko}\tau^{p}\leq \mu^{p}_{k} \leq r^{pU}_{ko}\tau^{p}\\ &&x^{p}_{ij}\in\left[x^{pL}_{ij}, x^{pU}_{ij}\right]\\ &&y^{p}_{kj}\in \left[y^{pL}_{kj}, y^{pU}_{kj}\right]\\ &&z^{p}\geq0\\ &&\tau^{p}\geq0\\ &&\mu^{p}_{k}\geq0,&k=1,...,s\\ &&v^{p}_{i}\geq0,&i=1,...,m\\ &&\mu_{o}&free\\ &&\lambda_{j}\geq0,\\ \end{array} $$

(21)

$$ \begin{array}{llllc} \underline{D}_{o}^{p}=\min& \mu_{o}\\ &s.t.&\sum_{k=1}^{s}\mu^{q}_{k}y^{q}_{kj}-\sum_{i=1}^{m}v^{q}_{i}x^{q}_{ij}+\mu_{o}\geq0,&j=1,...n\\ &&\sum_{k=1}^{s}\mu^{q}_{k}y^{p}_{ko}=1\\ &&\sum_{i=1}^{m}v^{q}_{i}x^{p}_{io}=1\\ &&c^{qL}_{io}z^{q}\leq v^{q}_{i}\leq c^{qU}_{io}z^{q}\\ &&r^{qL}_{ko}\tau^{q}\leq \mu^{q}_{k} \leq r^{qU}_{ko}\tau^{q}\\ &&x^{q}_{ij}\in\left[x^{qL}_{ij}, x^{qU}_{ij}\right]\\ &&y^{q}_{kj}\in \left[y^{qL}_{kj}, y^{qU}_{kj}\right]\\ &&x^{p}_{io}\in\left[x^{pL}_{io}, x^{pU}_{io}\right]\\ &&y^{p}_{ko}\in \left[y^{pL}_{ko}, y^{pU}_{ko}\right]\\ &&z^{q}\geq0\\ &&\tau^{q}\geq0\\ &&\mu^{q}_{k}\geq0,&k=1,...,s\\ &&v^{q}_{i}\geq0,&i=1,...,m\\ &&\mu_{o}&free\\ &&\lambda_{j}\geq0.\\ \end{array} $$

(22)

Similar to Lemma (1) of (Podinovski 2001), we propose the following Lemma, which refers to the general weight bound problem:

Lemma 1

Imposing the absolute bounds of $c^{pL}_{io}z^{p}\leq v^{p}_{i}\leq c^{pU}_{io}z^{p}, (i=1,...,m, z^{p}\geq 0)$ and $r^{pL}_{ko}\tau ^{p}\leq \mu ^{p}_{k} \leq r^{pU}_{ko}\tau ^{p}, (k=1,...,s, \tau ^{p}\geq 0)$ is equivalent to imposing bounds on the ratios of the weights of the following form:

$\frac {c^{zL}_{io}}{c^{zU}_{ko}}\leq \frac {v^{z}_{i}}{v^{z}_{k}} \leq \frac {c^{zU}_{io}}{c^{zL}_{ko}}~~~~~ i, k=1...,m,~~k>i, z=p, q$,

$\frac {r^{zL}_{lo}}{r^{zL}_{\kappa o}}\leq \frac {\mu ^{z}_{l}}{\mu ^{z}_{\kappa }}\leq \frac {r^{zU}_{lo}}{r^{zL}_{\kappa o}}~~~~ l, \kappa =1,...,s,~~~\kappa >l, z=p, q$.

Let $y_{kj}=\alpha _ky^{U}_{kj}+(1-\alpha _k)y^{L}_{kj}$ and $x_{ij}=\beta _ix^{U}_{ij}+(1-\beta _i)x^{L}_{ij}$ for some α_k∈[0,1] and β_i∈[0,1]. It is easy to show that the first three constraints of models (21) and (22) can be written as (23) and (24), respectively:

$$ {}\begin{aligned} &\sum_{k=1}^{s}\gamma_{k}\left(y^{Up}_{kj}-y^{Lp}_{kj}\right)+\sum_{k=1}^{s}\mu^{p}_{k}y^{Lp}_{kj}-\sum_{i=1}^{m}v^{p}_{i}x^{Lp}_{ij}-\sum_{i=1}^{m}\omega_{i}\left(x^{Up}_{ij}-x^{Lp}_{ij}\right)+\mu_{o}\geq0,&j=1,...n\\ &\sum_{k=1}^{s}\gamma_{k}\left(y^{Up}_{ko}-y^{Lp}_{ko}\right)+\sum_{k=1}^{s}\mu^{p}_{k}y^{Lp}_{ko}=1\\ &\sum_{i=1}^{m}\omega_{i}\left(x^{Up}_{io}-x^{Lp}_{io}\right)+\sum_{i=1}^{m}v^{p}_{i}x^{Lp}_{io}=1,\\ \end{aligned} $$

(23)

$$ {}\begin{aligned} &\sum_{k=1}^{s}\gamma_{k}\left(y^{Uq}_{kj}-y^{Lq}_{kj}\right)+\sum_{k=1}^{s}\mu^{q}_{k}y^{Lq}_{kj}-\sum_{i=1}^{m}v^{q}_{i}x^{Lq}_{ij}-\sum_{i=1}^{m}\omega_{i}\left(x^{Uq}_{ij}-x^{Lq}_{ij}\right)+\mu_{o}\geq0,&j=1,...n\\ &\sum_{k=1}^{s}\gamma_{k}\left(y^{Up}_{ko}-y^{Lp}_{ko}\right)+\sum_{k=1}^{s}\mu^{q}_{k}y^{Lp}_{ko}=1\\ &\sum_{i=1}^{m}\omega_{i}\left(x^{Up}_{io}-x^{Lp}_{io}\right)+\sum_{i=1}^{m}v^{q}_{i}x^{Lo}_{io}=1,\\ \end{aligned} $$

(24)

where γ_k=μ_kα_k and ω_i=v_iβ_i for each i and k.

By applying Lemma 1 and constraints (23) and (24) to models (21) and (22), we obtain the equivalent linear formulations of models (21) and (22), called the CR-DEA models, as follows:

$$\begin{aligned} \underline{B}_{o}^{p}=\min \ \mu_{o}\\ s.t. \ \ \ \ \ &\sum_{k=1}^{s}\gamma_{k}(y^{Up}_{kj}-y^{Lp}_{kj})+\sum_{k=1}^{s}\mu^{p}_{k}y^{Lp}_{kj}-\sum_{i=1}^{m}v^{p}_{i}x^{Lp}_{ij}-\sum_{i=1}^{m}\omega_{i}(x^{Up}_{ij}-x^{Lp}_{ij})+\mu_{o}\geq0,&j=1,...n\\ &\sum_{k=1}^{s}\gamma_{k}(y^{Up}_{ko}-y^{Lp}_{ko})+\sum_{k=1}^{s}\mu^{p}_{k}y^{Lp}_{ko}=1\\ &\sum_{i=1}^{m}\omega_{i}(x^{Up}_{io}-x^{Lp}_{io})+\sum_{i=1}^{m}v^{p}_{i}x^{Lp}_{io}=1\\ &\frac{c^{pL}_{io}}{c^{pU}_{ko}}\leq\frac{v^{p}_{i}}{v^{p}_{k}} \leq\frac{c^{pU}_{io}}{c^{pL}_{ko}},~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ i, k=1...,m,k>i\\ &\frac{r^{pL}_{lo}}{r^{pL}_{\kappa o}}\leq\frac{\mu^{p}_{l}}{\mu^{p}_{\kappa}}\leq\frac{r^{pU}_{lo}}{r^{pL}_{\kappa o}},~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ l, \kappa=1,...,s, \kappa>l&\\ \end{aligned} $$

$$ \begin{aligned} &0\leq \gamma_{k}\leq \mu^{p}_{k}\\ &0\leq \omega_{i}\leq v^{p}_{i}\\ &\mu^{p}_{k}\geq0,~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~k=1,...,s&\\ &v^{p}_{i}\geq0,~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~i=1,...,m&\\ &\mu_{0}, free~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~, \end{aligned} $$

(25)

$$ \begin{aligned} \underline{D}_{o}^{p}=\min \ \mu_{o}\\ s.t.&\sum_{k=1}^{s}\gamma_{k}\left(y^{Uq}_{kj}-y^{Lq}_{kj}\right)+\sum_{k=1}^{s}\mu^{q}_{k}y^{Lq}_{kj}-\sum_{i=1}^{m}v^{q}_{i}x^{Lq}_{ij}-\sum_{i=1}^{m}\omega_{i}\left(x^{Uq}_{ij}-x^{Lq}_{ij}\right)+\mu_{o}\geq0,&j=1,...n\\ &\sum_{k=1}^{s}\gamma_{k}\left(y^{Up}_{ko}-y^{Lp}_{ko}\right)+\sum_{k=1}^{s}\mu^{q}_{k}y^{Lp}_{ko}=1\\ &\sum_{i=1}^{m}\omega_{i}\left(x^{Up}_{io}-x^{Lp}_{io}\right)+\sum_{i=1}^{m}v^{q}_{i}x^{Lp}_{io}=1\\ &\frac{c^{qL}_{io}}{c^{qU}_{ko}}\leq\frac{v^{q}_{i}}{v^{q}_{k}} \leq\frac{c^{qU}_{io}}{c^{qL}_{ko}},~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ i, k=1...,m,k>i&\\ &\frac{r^{qL}_{lo}}{r^{qL}_{\kappa o}}\leq\frac{\mu^{q}_{l}}{\mu^{q}_{\kappa}}\leq\frac{r^{qU}_{lo}}{r^{qL}_{\kappa o}},~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ l, \kappa=1,...,s, \kappa>l&\\ &0\leq \gamma_{k}\leq \mu^{q}_{k}\\ &0\leq \omega_{i}\leq v^{q}_{i}\\ &\mu^{q}_{k}\geq0,~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~k=1,...,s&\\ &v^{q}_{i}\geq0,~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~i=1,...,m&\\ &\mu_{o},~~~~~~free.\\ \end{aligned} $$

(26)

Now, we proceed to models (15) and (17). By applying the mentioned variable alterations to (15) and (17), we have:

$$ \begin{array}{llllc} \overline{B}_{o}^{p}=\max&\min&\ \mu_{o}\\ \frac{v^{p}_{i}}{v^{p}_{k}}\in\Big[\frac{c^{pL}_{io}}{c^{pU}_{ko}},\frac{c^{pU}_{io}}{c^{pL}_{ko}}\Big]\\ \frac{\mu^{p}_{l}}{\mu^{p}_{\kappa}}\in\Big[\frac{r^{pL}_{lo}}{r^{pL}_{\kappa o}},\frac{r^{pU}_{lo}}{r^{pL}_{\kappa o}}\Big]\\ x^{p}_{ij}\in\left[x^{pL}_{ij}, x^{pU}_{ij}\right]\\ y^{p}_{kj}\in \left[y^{pL}_{kj}, y^{pU}_{kj}\right]\\ &s.t.&\sum_{k=1}^{s}\mu^{p}_{k}y^{p}_{kj}-\sum_{i=1}^{m}v^{p}_{i}x^{p}_{ij}+\mu_{o}\geq0,&j=1,...n\\ &&\sum_{k=1}^{s}\mu^{p}_{k}y^{p}_{ko}=1\\ &&\sum_{i=1}^{m}v^{p}_{i}x^{p}_{io}=1\\ &&\mu^{p}_{k}\geq0,&k=1,...,s\\ &&v^{p}_{i}\geq0,&i=1,...,m\\ &&\mu_{0}&free,\\ \end{array} $$

(27)

$$\begin{array}{llllc} \overline{D}_{o}^{p}=\max&\min&\ \mu_{o}\\ \frac{\mu^{q}_{l}}{\mu^{q}_{\kappa}}\in\Big[\frac{r^{qL}_{lo}}{r^{pL}_{\kappa o}},\frac{r^{qU}_{lo}}{r^{qL}_{\kappa o}}\Big]\\ \frac{\mu^{q}_{l}}{\mu^{q}_{\kappa}}\in\Big[\frac{r^{qL}_{lo}}{r^{qL}_{\kappa o}},\frac{r^{qU}_{lo}}{r^{qL}_{\kappa o}}\Big]\\ x^{q}_{ij}\in[x^{qL}_{ij}, x^{qU}_{ij}]\\ y^{q}_{kj}\in [y^{qL}_{kj}, y^{qU}_{kj}]\\ x^{p}_{io}\in[x^{pL}_{io}, x^{pU}_{io}]\\ y^{p}_{ko}\in [y^{pL}_{ko}, y^{pU}_{ko}]\\ \end{array} $$

$$ \begin{aligned} s.t.\ \ \ \ \ \ &\sum_{k=1}^{s}\mu^{q}_{k}y^{q}_{kj}-\sum_{i=1}^{m}v^{q}_{i}x^{q}_{ij}+\mu_{o}\geq0,&j=1,...n\\ &\sum_{k=1}^{s}\mu^{q}_{k}y^{p}_{ko}=1\\ &\sum_{i=1}^{m}v^{q}_{i}x^{p}_{io}=1\\ &\mu^{q}_{k}\geq0,&k=1,...,s\\ &v^{q}_{i}\geq0,&i=1,...,m\\ &\mu_{0}&free. \end{aligned} $$

(28)

Models (27) and (28) are two-level models. Several authors have proposed methods for solving two-level programs (see, e.g., (Bialas and Karwan 1984; Vicente and Calamai 1994)). However, due to the special structure of models (27) and (28), we introduce another solution in “Computational aspects” section.

We summarize the facts in the above propositions as follows:

• 1. If we enclose uncertain data into the profit efficiency model (3) as within-period model (5), this model measures the upper bound on the profit efficiency of DMU_o in time periods t and t+1. If we enclose the same uncertain data into the CR-DEA DEA model in the form of weight restrictions as model (25), this model measures the lower bound on the profit efficiency of DMU_o in time periods t and t+1.

• 2. If we enclose uncertain data into the profit efficiency model (4) as adjacent-period model (6), this model measures the upper bound on the profit efficiency of DMU_o at time t (t+1) relative to the frontier at time t+1 (t). If we enclose uncertain data into the CR-DEA DEA model in the form of weight restrictions as model (26), this model measures the lower bound on the profit efficiency of DMU_o at time t (t+1) relative to the frontier at time t+1 (t).

• 3. Profit efficiency model (5), model UPEW-S (7), and two-level model (27) yield the same profit efficiency as potential profit efficiency or the upper bound of profit efficiency in the within period. Model (5) incorporates uncertain data directly into the envelopment model. Model (7) measures the same profit efficiency for the most optimistic viewpoint. A similar argument can be put forward for models (6), (9), and (28).

• 4. UPEW-P model (8), two-level model (12), and CR-DEA model (25) yield the same efficiency as perfect efficiency or the lower bound of the profit efficiency of DMU_o at time periods t and t+1 (in the within period). Model (8) calculates the same profit efficiency of DMU_o from the pessimistic viewpoint. A similar argument can be put forward for model UPEA-P (10), two-level model (14), and CR-DEA model (26) (in the adjacent period).

Definition 9

The lower and upper bounds of the overall profit MPIs are obtained as follows:

$\overline {M}=\sqrt {\frac {\overline {\rho }^{t+1}_{t}}{\underline {\rho }^{t}_{t}}\times \frac {\overline {\rho }^{t+1}_{t+1}}{\underline {\rho }^{t}_{t+1}}}$,$\underline {M}=\sqrt {\frac {\underline {\rho }^{t+1}_{t}}{\overline {\rho }^{t}_{t}}\times \frac {\underline {\rho }^{t+1}_{t+1}}{\overline {\rho }^{t}_{t+1}}}$, where $\overline {\rho }^{p}_p~\left (\underline {\rho }^{p}_{p}\right), p=t, t+1$ represents the optimistic (pessimistic) efficiency in the within period and is computed by model (7)(8) and definition 3. Additionally, $\overline {\rho }^{p}_{q} ~\left (\underline {\rho }^{p}_{q}\right), p,q=t, t+1, p\neq q$ represents the optimistic (pessimistic) efficiency in the adjacent-period time, and is computed by model (9)(10) and definition 3.

Theorem 3

Any $\underline {M}\leq M\leq \overline {M}$ can be considered as the overall profit MPI for DMU_o.

Proof

See (Emrouznejad et al. 2011). □

Emrouznejad et al. (2011) divided the overall MPI of any DMU_o into six classes, as follows:

• No change in productivity class. This class includes all the DMUs with constant productivity, that is, $E_o=\{DMU_j:\underline {M}_j=\overline {M}_j=1\}$.

• Fully increasing productivity class. This class includes all the DMUs with increasing productivity and observed progress under the pessimistic viewpoint, that is, $E^{++}=\{DMU_j:1<\underline {M}_{j}\leq \overline {M}_{j}\}$.

• Fully decreasing productivity class. This class includes all the DMUs with decreasing productivity and observed regress under the optimistic viewpoint, that is, $E^{--}=\{DMU_j:\underline {M}_{j}\leq \overline {M}_j<1\}$.

• Partially increasing productivity class. This class includes all the DMUs with increasing productivity under the optimistic viewpoint and no change in productivity under the pessimistic viewpoint, that is, $E^{+}=\{DMU_j:\underline {M}_j=1, \overline {M}_j>1\}$.

• Partially decreasing productivity class. This class includes all the DMUs with decreasing productivity under the pessimistic viewpoint and no change in productivity under the optimistic viewpoint, that is, $E^{-}=\{DMU_j:\underline {M}_j<1, \overline {M}_j=1\}$.

• Partially increasing–decreasing productivity class. This class includes all the DMUs with increasing productivity under the optimistic viewpoint and decreasing productivity under the pessimistic viewpoint, that is, $E=\{DMU_j:\underline {M}_j<1<\overline {M}_{j}\}$.

Computational aspects

As mentioned in the previous section, we can use CR-DEA models (25) and (26) to obtain the lower bounds of the overall profit efficiency of DMU_o from the pessimistic viewpoint in the within $\left (\underline {B}_{o}^{p}\right)$ and adjacent periods ($\underline {D}_{o}^{q}$), respectively. Regarding the upper bounds, models (27) and (28) are nonlinear two-level programs and cannot be converted to linear one-level programs. Therefore, we propose new methods to achieve the upper bounds as follows. We define $\theta (v, \mu)=\min \left \{\mu _{o}\mid \mu _{o}\geq \sum _{i=1}^{m}v^{p}_{i}x^{p}_{ij}-\sum _{k=1}^{s}\mu ^{p}_{k}y^{p}_{kj}, v^{p}_{i},\mu ^{p}_{k}\geq 0\right \}$. It can be shown that θ(v,μ) is piecewise linear, piecewise continuous, and a convex function. Moreover, the feasible spaces of (27) and (28) are bounded. As such, models (27) and (28) have bounded optimal solutions that occur on boundary of the feasible spaces. Therefore, we have the following propositions:

Proposition 1

The optimal objective value of (27) is equal to:

$$ \begin{aligned}\max\left\{\sum_{k=1}^{s}\gamma(j)^{*}_{k}\left(y^{Up}_{kj}-y^{Lp}_{kj}\right)+\sum_{k=1}^{s}\mu(j)^{p*}_{k}y^{Lp}_{kj}-\sum_{i=1}^{m}v(j)^{p*}_{i}x^{Lp}_{ij}-\sum_{i=1}^{m}\omega(j)^{*}_{i}\left(x^{Up}_{ij}-x^{Lp}_{ij}\right),j=1,..., n\right\}, \end{aligned} $$

(29)

where (γ(j)^∗,v(j)^p∗,μ(j)^p∗,ω(j)^∗)(j=1,...,n) are the optimal solutions of the following linear model:

$$ \begin{aligned} \max\ \ &\left\{\sum_{k=1}^{s}\gamma_{k}\left(y^{Up}_{kj}-y^{Lp}_{kj}\right)+\sum_{k=1}^{s}\mu^{p}_{k}y^{Lp}_{kj}-\sum_{i=1}^{m}v^{p}_{i}x^{Lp}_{ij}-\sum_{i=1}^{m}\omega_{i}\left(x^{Up}_{ij}-x^{Lp}_{ij}\right)\right\},&j=1,...,n\\ s.t.\ \ &\sum_{k=1}^{s}\gamma_{k}\left(y^{Up}_{ko}-y^{Lp}_{ko}\right)+\sum_{k=1}^{s}\mu^{p}_{k}y^{Lp}_{ko}=1\\ &\sum_{i=1}^{m}\omega_{i}\left(x^{Up}_{io}-x^{Lp}_{io}\right)+\sum_{i=1}^{m}v^{p}_{i}x^{Lp}_{io}=1\\ &\frac{c^{pL}_{io}}{c^{pU}_{ko}}v^{p}_{k}\leq v^{p}_{i}\leq \frac{c^{pU}_{io}}{c^{pL}_{ko}}v^{p}_{k}~~~~~~~~~~~i, k=1...,m, k>i\\ &\frac{r^{pL}_{lo}}{r^{pU}_{\kappa o}}\mu^{p}_{\kappa}\leq \mu^{p}_{l} \leq \frac{r^{pU}_{lo}}{r^{pL}_{\kappa o}}\mu^{p}_{\kappa}~~~~~~~~~~~l, \kappa=1,...,s, \kappa>l\\ &0\leq \gamma_{k}\leq \mu^{p}_{k}\\ &0\leq \omega_{i}\leq v^{p}_{i}\\ &\mu^{p}_{k}\geq0,~~~~~~~~~~~k=1,...,s\\ &v^{p}_{i}\geq0,~~~~~~~~~~~i=1,...,m.\\ \end{aligned} $$

(30)

Proposition 2

The optimal objective value of (28) is equal to:

$$ \begin{aligned}\max\left\{\sum_{k=1}^{s}\gamma(j)^{*}_{k}\left(y^{Uq}_{kj}-y^{Lq}_{kj}\right)+\sum_{k=1}^{s}\mu(j)^{q*}_{k}y^{Lq}_{kj}-\sum_{i=1}^{m}v(j)^{q*}_{i}x^{Lq}_{ij}-\sum_{i=1}^{m}\omega(j)^{*}_{i}\left(x^{Uq}_{ij}-x^{Lq}_{ij}\right),j=1,..., n\right\}, \end{aligned} $$

(31)

where (γ(j)^∗,v(j)^q∗,μ(j)^q∗,ω(j)^∗)(j=1,...,n) are the optimal solutions of the following linear model:

$$ {}\begin{aligned} \max\ \ &\left\{\sum_{k=1}^{s}\gamma_{k}\left(y^{Uq}_{kj}-y^{Lq}_{kj}\right)+\sum_{k=1}^{s}\mu^{q}_{k}y^{Lq}_{kj}-\sum_{i=1}^{m}v^{q}_{i}x^{Lq}_{ij}-\sum_{i=1}^{m}\omega_{i}\left(x^{Uq}_{ij}-x^{Lq}_{ij}\right)\right\},&j=1,...n\\ \end{aligned} $$

$$ {}\begin{aligned} s.t.\ \ &\sum_{k=1}^{s}\gamma_{k}\left(y^{Up}_{ko}-y^{Lp}_{ko}\right)+\sum_{k=1}^{s}\mu^{q}_{k}y^{Lp}_{ko}=1\\ &\sum_{i=1}^{m}\omega_{i}\left(x^{Up}_{io}-x^{Lp}_{io}\right)+\sum_{i=1}^{m}v^{q}_{i}x^{Lp}_{io}=1\\ &\frac{c^{qL}_{io}}{c^{qU}_{ko}}v^{q}_{k}\leq v^{q}_{i}\leq \frac{c^{qU}_{io}}{c^{qL}_{ko}}v^{q}_{k}~~~~~~~~~~~~i, k=1...,m, k>i\\ &\frac{r^{qL}_{lo}}{r^{qU}_{\kappa o}}\mu^{q}_{\kappa}\leq \mu^{q}_{l} \leq \frac{r^{qU}_{lo}}{r^{qL}_{\kappa o}}\mu^{q}_{\kappa}~~~~~~~~~~~l, \kappa=1,...,s, \kappa>l\\ &0\leq \gamma_{k}\leq \mu^{q}_{k}\\ &0\leq \omega_{i}\leq v^{q}_{i}\\ &\mu^{q}_{k}\geq0,~~~~~~~~~~~k=1,...,s\\ &v^{q}_{i}\geq0,~~~~~~~~~~~i=1,...,m\\ &\mu_{0}~~~~~~~~~~~free.\\ \end{aligned} $$

(32)

In model (30) (32) we maximize the linear objective functions individually and then calculate the highest using (29) (31).

Example. We consider five DMUs with two inputs and two outputs, as per Table 1. Table 2 shows the interval price vectors at time t and t+1. Using models (25) and (30), the interval of profit efficiency for DMU_o in the within period is $\left [\underline {B}_{o}^{p}, \overline {B}_{o}^{p}\right ]$ and using models (26) and (32) the interval of profit efficiency for DMU_o in the adjacent period time is $\left [\underline {D}_{o}^{q}, \overline {D}_{o}^{q}\right ]$. The overall profit MPIs are shown in Table 3. As per Table 3, DMU₄ is classified in the fully increasing productivity class, which is the observed progress under the pessimistic viewpoint. Other DMUs are classified in the partially increasing–decreasing productivity class and they thus have increasing productivity under the optimistic viewpoint and decreasing productivity under the pessimistic viewpoint. DMU₃ has the highest productivity progress of 2.975 under the optimistic viewpoint and DMU₅ the highest productivity decrease of 0.217. According to the optimistic viewpoint, all DMUs can be ranked by their productivity progress in the order DMU₃≻DMU₁≻DMU₄≻DMU₅≻DMU₂. However, according to the pessimistic viewpoint, the productivity regress is in the order DMU₄≻DMU₁≻DMU₃≻DMU₅≻DMU₂. Obviously, the productivity increase ranking may differ from the productivity decrease one.

Table 1 Input and output data for the five DMUs in Example 1 at times t and t+1. Extracted from Emrouznejad et al. (2011)

Table 2 Numerical example 1

Table 3 Numerical example 1

Conclusions

Conventional DEA can be used to compute the productivity changes of a DMU over time under the profit MPI model, provided that the input, output, input costs, and output prices are known and exact for each DMU. However, in many situations, some inputs and/or outputs and input-output prices are imprecise. However, the conventional profit MPI model is not suitable to deal with inexact prices. Emrouznejad et al. (2011) studied the overall profit MPI using DEA with imprecise data and proposed two novel methods for measuring overall profit MPI. In this paper, we showed their method has some shortfalls. To overcome these shortfalls, we reformulated the conventional profit MPI model as an IDEA model by incorporating the available information into profit efficiency models and the same information into CR-DEA models in the form of a cone-ratio weight restriction. Additionally, the lower bounds of profit efficiency were easily calculated by solving a linear one-level program. Regarding the upper bounds, we proposes a new approach of solving n linear programming problems for each bound. This is the penalty we pay to calculate the upper bound of the overall profit efficiency when the data are inexact. We also presented a numerical example to demonstrate the applicability of the proposed framework.