A multi-stage methodology for the solution of orientated DEA models

DOI10.1016/S0167-6377(98)00036-4zbMATH Open0963.91032OpenAlexW2076454816WikidataQ128089865 ScholiaQ128089865MaRDI QIDQ1306391FDOQ1306391

Authors: Tim Coelli 

Publication date: 27 June 2001

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0167-6377(98)00036-4

Recommendations

• A comment on multi-stage DEA methodology
• Deriving the DEA frontier for two-stage processes
• Equivalence in two-stage DEA approaches
• An algorithm for data envelopment analysis

zbMATH Keywords

linear programmingDEApeersunits-invariance

Mathematics Subject Classification ID

Management decision making, including multiple objectives (90B50) Linear programming (90C05) Decision theory (91B06)

Cites Work

• Some Models for Estimating Technical and Scale Inefficiencies in Data Envelopment Analysis
• Measuring the efficiency of decision making units
• Foundations of data envelopment analysis for Pareto-Koopmans efficient empirical production functions
• Units invariant and translation invariant DEA models

Cited In (23)

• Semi-radial technical efficiency measurement
• A modified discrete Raiffa approach for efficiency assessment and target setting
• Radial data envelopment analysis models with mixed orientation of input and output
• A comparative approach to the economic modelling of a large-scale wave power scheme
• Finding the closest efficient targets in DEA by a numeration method: the FDH non-convex technology
• A modified distance friction minimization approach in data envelopment analysis
• Finding closest target for bank branches in the presence of weight restrictions using data envelopment analysis
• Input-output substitutability and strongly monotonic \(p\)-norm least distance DEA measures
• Decomposing technical inefficiency using the principle of least action
• From efficiency measurement to efficiency improvement: The choice of a relevant benchmark
• Finding target units in FDH model by least-distance measure model
• A New MIP Approach on the Least Distance Problem in DEA
• AN EXTENDED NUMERATION METHOD FOR SOLVING FREE DISPOSAL HULL MODELS IN DEA
• Benchmarking within a DEA framework: setting the closest targets and identifying peer groups with the most similar performances
• Decomposing the efficient frontier of the DEA production possibility set into a smallest number of convex polyhedrons by mixed integer programming
• Closest targets in the slacks-based measure of efficiency for production units with multi-period data
• A comment on multi-stage DEA methodology
• A well-defined composite indicator: an application to corporate social responsibility
• Benchmarking in data envelopment analysis: an approach based on genetic algorithms and parallel programming
• An interactive MOLP method for solving output-oriented DEA problems with undesirable factors
• The relevance of DEA benchmarking information and the least-distance measure
• A well-defined efficiency measure for dealing with closest targets in DEA
• Using a hybrid two‐stage DEA model to analyze the profitability and marketability of medical manufacturing firms

Uses Software

• DEAP

This page was built for publication: A multi-stage methodology for the solution of orientated DEA models

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1306391)