Figures
Abstract
In centralized organizations, senior managers typically supervise multiple comparable decision-making units (DMUs), and improving overall efficiency depends on identifying units that performance has more impact on systems. Although Data Envelopment Analysis (DEA) has been extensively applied for performance evaluation in such environments, most traditional DEA-based approaches, such as super-efficiency, focus on local efficiency instead of the collective contribution of multiple DMUs. More recent centralized DEA formulations used to identify outstanding units partially remove this limitation; however, many of these models rely on predefined constants, which may lead to infeasible or unbounded optimization problems and reduce the robustness and interpretability of the results. This study proposes a new DEA-based mixed-integer nonlinear programming model to identify a subset of k outstanding DMUs from n units operating within a centralized system. The proposed model eliminates the need for any predefined constants and guarantees feasibility and boundedness. The proposed model is validated using two empirical. From a managerial perspective, the proposed approach provides a practical decision-support tool for centralized organizations.
Citation: Cheraghali Z, Rostamy-Malkhalifeh M (2026) Identifying outstanding units in centralized systems: A DEA approach. PLoS One 21(5): e0344454. https://doi.org/10.1371/journal.pone.0344454
Editor: Alexandre Morais Nunes, Universidade de Lisboa Instituto Superior de Ciencias Sociais e Politicas, PORTUGAL
Received: December 16, 2025; Accepted: February 22, 2026; Published: May 14, 2026
Copyright: © 2026 Cheraghali, Rostamy-Malkhalifeh. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.
Data Availability: All relevant data are within the paper and its Supporting information files.
Funding: The author(s) received no specific funding for this work.
Competing interests: The authors have declared that no competing interests exist.
1. Introduction
Centralized organizational structures are widely observed in both public and private sectors, have multi-branch firms operating across different regions or countries. In such systems, a senior manager typically supervises a large number of comparable decision-making units (DMUs). A key managerial challenge in these organizations is motivating local managers to improve not only their individual performance but also their collective contribution to organizational objectives. Because local decisions jointly determine system-wide outcomes, performance evaluation and incentive design in centralized systems must explicitly account for collective effects rather than focusing solely on individual units.
Data Envelopment Analysis (DEA) has been extensively used as a nonparametric approach for performance evaluation in multi-input–multi-output environments. Classical DEA models, such as the CCR and BCC, primarily focus on measuring the relative efficiency of individual DMUs. While these models are well suited for benchmarking and local performance assessment, they offer limited guidance for centralized decision-making, where the primary concern is improving overall system efficiency rather than optimizing the performance of individual units. To overcome this limitation, several extensions of DEA have been proposed, including super-efficiency models, which allow efficient DMUs to be ranked by excluding the evaluated unit from the reference set [1]. Despite their usefulness, super-efficiency models remain fundamentally local in nature and do not capture the joint impact of multiple DMUs on system performance.
Recognizing the need for system evaluation, a growing stream of literature has focused on centralized DEA models. Early contributions by Lozano and Villa [2] and Asmild et al. [3] proposed centralized DEA models that aggregate inputs and outputs across DMUs to evaluate overall efficiency and support resource allocation decisions. Varmaz et al. [4] further explored centralized planning and yardstick competition in multi-unit organizations. Although these approaches provide valuable insights into aggregate efficiency, they typically treat all DMUs symmetrically and do not explicitly identify those units whose performance disproportionately influences overall system outcomes. Consequently, their applicability for incentive design and targeted managerial interventions remains limited.
To solve this problem, Afsharian et al. [5] and Afsharian and Bogetoft [6] introduced DEA-based incentive systems for centrally managed organizations. In particular, Afsharian and Bogetoft [6] proposed a model that identifies a subset of outstanding DMUs based on their collective contribution to total organizational efficiency. This framework represents an important advancement by explicitly linking efficiency measurement with managerial motivation and incentive design in centralized systems. By focusing on the joint impact of selected DMUs, the model moves beyond purely local efficiency assessments and provides a more system-oriented perspective on performance evaluation.
Despite its conceptual appeal, the model proposed by Afsharian and Bogetoft [6] relies on predefined constants. As demonstrated in this study, the inclusion of such externally specified parameters may lead to infeasible or unbounded problems. Moreover, the choice of these constants is inherently arbitrary and may significantly affect the resulting efficiency scores and the identification of outstanding units. These issues reduce the robustness, interpretability, and practical applicability of the model, particularly in real-world managerial settings where parameter tuning is undesirable.
Motivated by these limitations, this paper proposes a new DEA-based methodology for identifying a subset of k outstanding DMUs from among n existing units within a centralized system. The proposed model eliminates the need for any predefined constants and guarantees both feasibility and boundedness. Methodologically, the model introduces a binary selection mechanism that directly links efficiency constraints to the selection of DMUs, while restricting the objective function to the outputs of the selected units.
By capturing collective performance effects in a robust and theoretically sound manner, the proposed framework provides a more comprehensive assessment of outstanding performance in centralized organizations. From a managerial perspective, the model offers a practical decision-support tool that enables central authorities to identify key performance-driving units, design incentive schemes aligned with system-level objectives, prioritize monitoring and benchmarking efforts, and guide resource allocation decisions.
The effectiveness of the proposed methodology is illustrated through two empirical case studies, and the results are compared with those obtained from existing DEA-based approaches. The findings demonstrate that the proposed model not only avoids infeasibility and unboundedness issues observed in earlier formulations, but also provides clearer and more interpretable insights into how exceptional DMUs contribute to overall organizational efficiency.
The remainder of this paper is organized as follows. Section 2 reviews related literature on DEA models and incentive mechanisms in centralized systems. Section 3 presents the proposed model and discusses its theoretical properties. In Section 4, we apply the model to two datasets and analyze the results and discuss managerial implications, and Section 5 concludes the paper with directions for future research.
2. Preliminaries and fundamentals
Let us consider a set of DMUs, denoted by , each utilizing
inputs to produce
outputs. For each DMUj, Let
and
be non-negative and non-zero vectors representing the inputs and outputs of DMUj,
. The efficiency of a particular unit DMUo, denoted by Eo, is evaluated by the classical input-oriented DEA model introduced by Charnes et al. [7]:
In model (1), vi and ur are the weights of the ith input and rth output, respectively (for more details, see [8–11].
One of the methods to rank the efficient DMUs and find one outstanding DMU in DEA is the super-efficiency method [12], originally introduced by Andersen and Petersen [1]. In this method, the DMU under evaluation is excluded from the reference set that defines the efficient frontier. By considering the super-efficiency condition, model (1) is then reformulated as model (2):
The super-efficiency model allows efficient DMUs to be ranked beyond the frontier for further reading, see Zanboori et al. [13]. However, this approach primarily captures local efficiency rather than the global or collective effect of DMUs on overall system performance. When identifying multiple outstanding units, this method must be executed iteratively — removing each identified DMU from the dataset before re-running the model. Such a stepwise process does not reflect the combined influence of selected DMUs on the organization as a whole. To evaluate the overall efficiency of a system comprising multiple units under centralized control, the centralized DEA model is often employed. Its general form can be expressed as follows:
In model (3), the objective function and the first constraint consider the aggregate levels of each output and input, while the remaining constraints are similar to those in model (1). Since model (3) is input-oriented, it aims to minimize total inputs while maintaining output levels. Several centralized DEA formulations have been proposed in the literature [e.g., 4,3,Lozana and Villa, 2004,5 can be referred to].
To extend the concept of super-efficiency to centralized systems, model (3) can be modified as follows:
Although this extension provides a means to identify efficient units within a centralized setting, it neglects the collective impact of multiple DMUs. To address this limitation, Afsharian and Bogetoft [6] proposed a model that identifies a subset of k outstanding DMUs (k ≤ n) that collectively contribute most to the overall efficiency of the system. Their model is formulated as:
[For more details, see 14–16]. While this model effectively incorporates the selection of multiple outstanding DMUs, it may still yield unbounded or infeasible results under certain data configurations. To overcome these drawbacks, we develop an enhanced model in the next section that ensures both feasibility and boundedness while retaining the ability to evaluate the joint impact of selected DMUs.
3. Proposed model
To identify the subset of k DMUs that exert the greatest influence on the overall efficiency of the centralized system, we introduce a binary selection variable , defined as follows:
Using this binary variable, we propose the following mixed-integer nonlinear programming (MINLP) model to identify the k outstanding DMUs that contribute most significantly to total system efficiency:
Model (7) improves upon the model of Afsharian and Bogetoft [6] by eliminating the need for any predefined constants. In the earlier formulation, the constant must be selected exogenously, and inappropriate values may lead to infeasible or unbounded optimization problems. In contrast, the proposed model derives the selection of outstanding DMUs endogenously through the optimization structure itself, thereby enhancing both robustness and interpretability.
From a methodological perspective, Model (7) reformulates the selection mechanism by directly linking the efficiency constraints to the binary selection variable . When
, the corresponding constraint forces the weighted outputs of DMUj to be dominated by its weighted inputs, ensuring that non-selected DMUs do not contribute positively to the objective function.
When , the constraint reduces to the standard DEA efficiency condition, allowing the DMU to contribute to overall efficiency. Importantly, all DMUs remain part of the reference technology through the constraint set; non-selected units are not removed from the production possibility set, which addresses potential ambiguity associated with the term “elimination”.
A key property of the proposed model is that feasibility and boundedness are guaranteed for any . Feasibility follows from the existence of non-negative weights satisfying the normalization constraint, while boundedness is ensured by the restriction of the objective function to the outputs of selected DMUs combined with the fixed normalization of aggregate inputs. As a result, the objective value is inherently bounded above, and the model avoids the infeasibility and unboundedness issues observed in previous formulations.
Conceptually, Model (7) differs from Model (5) in how overall efficiency is evaluated. While Model (5) includes all DMUs in the computation of total efficiency—even those not identified as outstanding—the proposed model restricts the objective function exclusively to the performance of the selected DMUs (). Consequently, the resulting efficiency measure explicitly reflects the joint contribution of the chosen subset of DMUs to system-level performance, rather than diluting this effect by aggregating over the entire set of units.
By directly capturing the aggregated impact of the most influential DMUs, the objective function in Model (7) provides a more accurate and interpretable measure of collective performance in centralized systems. This model enables decision-makers to assess how different combinations of outstanding units influence overall efficiency and supports more informed managerial decisions regarding incentive design and resource allocation.
Now, we formally discuss the feasibility and boundedness of the proposed model (7) for any admissible value of k.
- Feasibility.
For any , model (7) is feasible. To see this, observe that the normalization constraint
, admits at least one feasible solution for non-negative weights vi, provided that the aggregate input vector is strictly positive, which is a standard assumption in DEA. Given such weights, setting ur = 0 for all
and selecting any subset of k DMUs by assigning
for the selected units and
otherwise satisfies all remaining constraints. Hence, the feasible region of model (7) is non-empty for all admissible values of k.
- Boundedness.
The objective function of model (7) is bounded above. This follows from two key structural properties. First, the normalization constraint fixes the weighted sum of aggregate inputs to unity, which restricts the scale of the input weights. Second, for each DMUj, the constraint implies that the weighted outputs of any selected DMU (
) are bounded above by
. Since the number of selected DMUs is fixed at k and all variables are non-negative, the objective function cannot grow unboundedly.
Taken together, these properties ensure that model (7) is both feasible and bounded. This analytical argument complements the numerical evidence presented in the subsequent section and distinguishes the proposed model from earlier models that rely on predefined constants and may suffer from infeasibility or unboundedness.
In the following section, the limitations of Model (5) are illustrated through a numerical example. Subsequently, the proposed model is applied to the dataset used by Varmaz et al. [4] to validate its effectiveness, followed by a comparative analysis of the results.
4. Case study
To compare the proposed model with existing DEA-based approaches, we apply it to two datasets. The first dataset is a small illustrative example, while the second dataset is taken from Varmaz et al. [4], which has been widely used in the centralized DEA literature.
- Example 1:
The first dataset, reported in Table 1, consists of six DMUs, each using two inputs to produce two outputs. The objective is to identify subsets of outstanding DMUs for different values of k. Specifically, we consider k = 0,1,2,3 and compare the results obtained from the model of Afsharian and Bogetoft [6] (Model (5)) and the proposed model (Model (7)). For Model (5), the predefined constant is set to , a value sufficiently large to satisfy the intended logic of the model, as commonly assumed in practice.
The results are summarized in Table 2. When k = 0, no DMU is selected as outstanding. In this case, the objective value of the proposed model is equal to zero, reflecting the fact that no unit contributes to the objective function. This result should be interpreted as a benchmark scenario rather than as an indication that efficiency disappears from the system. By contrast, Model (5) still yields a positive efficiency score because it continues to aggregate performance across all DMUs.
For k = 1 and k = 2, both models are able to identify subsets of outstanding DMUs, although the selected units and efficiency values differ. These differences highlight the conceptual distinction between the two formulations: Model (5) evaluates overall efficiency using all DMUs, whereas the proposed model restricts the objective function to the selected units only, thereby isolating their collective contribution.
A key observation arises for k = 3. As shown in Table 2, Model (5) becomes infeasible or unbounded, despite the large value assigned to . This behavior illustrates the sensitivity of the model to the predefined constant and confirms the concerns raised in the literature. In contrast, the proposed model remains feasible and bounded and successfully identifies three outstanding DMUs. This result empirically supports the theoretical properties discussed in the previous section.
- Example 2:
The second dataset, presented in Table 3, consists of 16 DMUs and four variables (three inputs and one output), originally studied by Varmaz et al. [4]. We apply the super-efficiency model, the centralized super-efficiency model, the model of Afsharian and Bogetoft [6], and the proposed model to identify outstanding DMUs for . The corresponding results are reported in Table 4.
Several important observations can be drawn from these results. First, when k = 1, the proposed model and the classical super-efficiency approach identify the same outstanding unit. This outcome is expected, as selecting a single outstanding DMU reduces the problem to a local efficiency comparison. However, as k increases, the advantages of the proposed model become more apparent.
Specifically, the efficiency values obtained from the proposed model increase monotonically with k, reflecting the growing collective contribution of the selected units. In contrast, the efficiency scores produced by Model (5) exceed unity and exhibit greater variability, which complicates interpretation from a managerial perspective. This difference stems from the fact that Model (5) aggregates performance across all DMUs, while the proposed model isolates the contribution of the selected subset.
Moreover, the proposed model remains feasible and numerically stable for all values of k considered. In several cases (e.g., k = 3 and k = 5), the proposed model identifies the same outstanding DMUs as Model (5), suggesting consistency in identifying key performance-driving units. However, unlike Model (5), the proposed model avoids infeasibility and provides bounded, interpretable efficiency scores for all scenarios.
From a managerial perspective, these results offer clear insights. By varying k, decision-makers can examine how the size and composition of the selected subset influence overall system efficiency. This flexibility enables managers to design incentive schemes, prioritize monitoring efforts, and allocate resources based on the collective impact of outstanding units rather than relying on isolated efficiency rankings.
Overall, the numerical examples demonstrate that the proposed model provides a more stable, robust, and interpretable framework for identifying groups of DMUs with a substantial influence on system-level efficiency. By eliminating predefined constants and explicitly capturing collective effects, the model addresses key limitations of existing DEA-based approaches and offers a practical decision-support tool for centralized organizations.
All models were implemented using GAMS. The proposed model is a mixed-integer nonlinear programming (MINLP) problem due to the presence of binary selection variables and bilinear terms involving weights and selection indicators.
For the datasets considered in this study, the proposed model converged reliably to optimal solutions for all tested values of k. The average computation time was approximately 40 seconds for the both datasets. Although the computational burden increases with the number of DMUs due to the combinatorial nature of the selection problem, the results indicate that the proposed model remains tractable for moderate-sized datasets. This suggests that the model is suitable for practical applications in centralized organizational settings, where the number of DMUs is typically limited.
5. Conclusion
This study developed a novel DEA-based framework for identifying outstanding decision-making units in centralized organizational systems. The proposed model overcomes a fundamental limitation of existing approaches by eliminating the need for predefined constants, which are known to induce infeasibility or unboundedness under certain data configurations. In contrast, the new model guarantees feasibility and boundedness for all admissible values of k, as established through analytical arguments and confirmed by numerical experiments.
Beyond its theoretical soundness, the proposed model introduces a conceptually important shift in the evaluation of performance in centralized systems. Rather than aggregating efficiency across all units, the model explicitly isolates and quantifies the collective contribution of a selected subset of DMUs to overall system efficiency. This distinction enables a more transparent and interpretable assessment of group-level performance.
The empirical analyses demonstrate that the proposed approach yields stable and consistent efficiency measures across different values of k, even in scenarios where existing models fail or produce implausible results. The ability of the model to remain well-behaved under varying data configurations highlights its robustness and practical relevance.
From a managerial standpoint, the framework offers actionable insights for senior decision-makers operating in centralized environments. By identifying combinations of units that exert the greatest influence on total efficiency, the model supports the design of incentive schemes, prioritization of managerial attention, and more effective allocation of limited resources. Importantly, the framework allows managers to explore trade-offs between the number of selected units and their collective impact on organizational performance.
Several promising directions for future research emerge from this work. Extensions to stochastic or fuzzy data environments would enhance applicability under uncertainty, while adaptations to hierarchical or networked organizational structures could broaden its relevance. Additionally, dynamic formulations that capture performance evolution over time represent a natural and valuable extension of the proposed approach.
References
- 1. Andersen P, Petersen NC. A procedure for ranking efficient units in data envelopment analysis. Manag Sci. 1993;39(10):1261–4.
- 2. Lozano S, Villa G. Centralized resource allocation using data envelopment analysis. J Prod Anal. 2004;22(1–2):143–61.
- 3. Asmild M, Paradi J, Pastor J. Centralized resource allocation BCC models☆. Omega. 2009;37(1):40–9.
- 4. Varmaz A, Varwig A, Poddig T. Centralized resource planning and Yardstick competition. Omega. 2013;41(1):112–8.
- 5. Afsharian M, Ahn H, Thanassoulis E. A DEA-based incentives system for centrally managed multi-unit organisations. Eur J Oper Res. 2017;259(2):587–98.
- 6. Afsharian M, Bogetoft P. Identifying production units with outstanding performance. Eur J Oper Res. 2020;287(3):1191–4.
- 7. Charnes A, Cooper WW, Rhodes E. Measuring the efficiency of decision-making units. Eur J Oper Res. 1979;3(4):339.
- 8.
Cooper WW, Seiford L, Tone K. Data envelopment analysis: a comprehensive text with models, applications, references and DEA-solver software. Boston: Kluwer; 2007.
- 9.
Ray SC. Data envelopment analysis: theory and techniques for economics and operations research. Cambridge: Cambridge University Press; 2004.
- 10. Mergoni A, Emrouznejad A, De Witte K. Fifty years of data envelopment analysis. Eur J Oper Res. 2025;326(3):389–412.
- 11. Bogetoft P, Otto L. A literature review of economic efficiency assessments using data envelopment analysis. Eur J Oper Res. 2024;313(1):1–20.
- 12.
Zhu J. Quantitative models for performance evaluation and benchmarking: data envelopment analysis with Spreadsheets. New York: Springer; 2014.
- 13. Zanboori E, Rostamy-Malkhalifeh M, Jahanshahloo GR, Shoja N. Calculating super efficiency of DMUs for ranking units in data envelopment analysis based on SBM model. ScientificWorldJournal. 2014;2014:382390. pmid:25243209
- 14. Davtalab-Olyaie M, Mahmudi-Baram H, Asgharian M. Incentivizing units in centralized systems: a slacks-based approach. J Oper Res Soc. 2021;73(8):1724–41.
- 15. Afsharian M, Ahn H, Thanassoulis E. Incentivizing centrally regulated units to improve performance: pitfalls and requirements. J Oper Res Soc. 2023;75(2):395–409.
- 16. Afsharian M. A metafrontier-based yardstick competition mechanism for incentivising units in centrally managed multi-group organisations. Ann Oper Res. 2019;288(2):681–700.