An effective computational attempt in DDEA

DOI10.1016/J.APM.2009.01.013MaRDI QIDQ965552zbMATH OpenOpenAlexFDO

Authors Majid Soleimani-Damaneh

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

zbMATH Keywords

computational complexitylinear programmingcost efficiencyDDEA

Mathematics Subject Classification ID

Management decision making, including multiple objectives (90B50) Abstract computational complexity for mathematical programming problems (90C60) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)

Recommendations

• scientific article; zbMATH DE number 975523
• A computational framework for accelerating DEA.
• scientific article; zbMATH DE number 1981899
• An algorithm for the effectiveness of DEA decision making units
• An algorithm for solving DAEs with mechanization
• An optimal parallel algorithm to construct a deap
• scientific article; zbMATH DE number 177005
• A computational study of DEA with massive data sets

Cites work

• scientific article; zbMATH DE number 5080888 (Why is no real title available?)
• scientific article; zbMATH DE number 47262 (Why is no real title available?)
• 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
• A simplified version of the DEA cost efficiency model
• A strange case of the cost and allocative efficiencies in DEA
• Cost efficiency analysis with ordinal data: a theoretical and computational view
• Cost efficiency measurement with price uncertainty: a DEA application to bank branch assessments
• Determination of returns to scale by CCR formulation without chasing down alternative optimal solutions
• Dynamic data envelopment analysis: Modeling intertemporal behavior of a firm in the presence of productive inefficiencies
• Estimating returns to scale in data envelopment analysis: a new procedure.
• Measuring the efficiency of decision making units
• On Pareto (dynamically) efficient paths
• On the estimation of returns-to-scale in FDH models
• Returns to scale in dynamic DEA
• Streamlined computation for data envelopment analysis

Cited in

(5)

• Network data envelopment analysis: a review
• Dynamic network data envelopment analysis based upon technology changes
• Dynamic DEA: relative efficiency measure of units
• A slacks-based model for dynamic data envelopment analysis
• A review of dynamic data envelopment analysis: state of the art and applications

This page was built for publication: An effective computational attempt in DDEA

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