A fast algorithm for determining some characteristics in DEA

DOI10.1057/JORS.2009.72MaRDI QIDQ3184425zbMATH OpenOpenAlexFDO

Authors Majid Soleimani-Damaneh

Publication date 15 October 2009

Published in The Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1057/jors.2009.72

zbMATH Keywords

DEAefficiencylinear programmingpolynomial-time algorithmRTS

Mathematics Subject Classification ID

Management decision making, including multiple objectives (90B50) Linear programming (90C05)

Recommendations

• An algorithm for data envelopment analysis
• A procedure for large-scale DEA computations
• A computational framework for accelerating DEA.
• Efficient algorithm for additive and multiplicative models in data envelopment analysis
• A computational study of DEA with massive data sets

Cited in

(3)

• Efficient algorithm for additive and multiplicative models in data envelopment analysis
• Measuring Technical, Allocative and Overall Efficiencies Using a DEA Algorithm
• Nonparametric cost and revenue functions under constant economies of scale: an enumeration approach for the single output or input case

This page was built for publication: A fast algorithm for determining some characteristics in DEA

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