An effective computational attempt in DDEA
From MaRDI portal
Publication:965552
DOI10.1016/j.apm.2009.01.013zbMath1205.90197OpenAlexW1964877897MaRDI QIDQ965552
Publication date: 24 April 2010
Published in: Applied Mathematical Modelling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.apm.2009.01.013
Abstract computational complexity for mathematical programming problems (90C60) Management decision making, including multiple objectives (90B50) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)
Related Items
Dynamic network data envelopment analysis based upon technology changes, Network data envelopment analysis: a review, A slacks-based model for dynamic data envelopment analysis, A review of Dynamic Data Envelopment Analysis: state of the art and applications
Cites Work
- Unnamed Item
- Unnamed Item
- Measuring the efficiency of decision making units
- Streamlined computation for data envelopment analysis
- A note on simulating weights restrictions in DEA: an improvement of Thanassoulis and Allen's method
- A polynomial-time algorithm to estimate returns to scale in FDH models
- Estimating returns to scale in data envelopment analysis: a new procedure.
- Cost efficiency measurement with price uncertainty: a DEA application to bank branch assessments
- Returns to scale in dynamic DEA
- Dynamic data envelopment analysis: Modeling intertemporal behavior of a firm in the presence of productive inefficiencies
- Determination of returns to scale by CCR formulation without chasing down alternative optimal solutions
- A simplified version of the DEA cost efficiency model
- On the estimation of returns-to-scale in FDH models
- On Pareto (dynamically) efficient paths
- A strange case of the cost and allocative efficiencies in DEA
- Cost efficiency analysis with ordinal data: a theoretical and computational view
