A review of inverse data envelopment analysis: origins, development and future directions
Bibliographic record
Abstract
Abstract Data envelopment analysis (DEA) is a widely used mathematical programming approach for assessing the efficiency of decision-making units (DMUs) in various sectors. Inverse DEA is a post-DEA sensitivity analysis approach developed initially for solving resource allocation. The main objective of inverse DEA is to determine the optimal quantity of inputs and/or outputs for each DMU under input and/or output perturbation (s), which would allow them to reach a given efficiency target. Since the early 2000s, inverse DEA has been extended theoretically and applied successfully in different areas including banking, energy, education, sustainability and supply chain management. In recent years, research has demonstrated the potential of inverse DEA for solving novel inverse problems, such as estimating merger gains, minimizing production pollution, optimizing business partnerships and more. This paper provides a comprehensive survey of the latest theoretical and practical advancements in inverse DEA while also highlighting potential areas for future research and development in this field. One such area is exploring the use of heuristic algorithms and optimization techniques in conjunction with inverse DEA models to address issues of infeasibility and nonlinearity. Moreover, applying inverse DEA to new sectors such as healthcare, agriculture and environmental and climate change issues holds great promise for future research. Overall, this paper sets the stage for further advancements in this promising approach.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.004 | 0.006 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.003 | 0.002 |
| Bibliometrics | 0.007 | 0.011 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.002 | 0.003 |
| Open science | 0.002 | 0.001 |
| Research integrity | 0.002 | 0.002 |
| Insufficient payload (model declined to judge) | 0.004 | 0.001 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".