A Euclidean distance-based measure of efficiency in data envelopment analysis

From MaRDI portal
Publication:3066915


DOI10.1080/02331930902878333zbMath1203.90080MaRDI QIDQ3066915

Sohrab Kordrostami, Alireza Amirteimoori

Publication date: 20 January 2011

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331930902878333

zbMATH Keywords

efficiency; DEA; super-efficiency; Euclidean distance


Mathematics Subject Classification ID

90B50: Management decision making, including multiple objectives

90C08: Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.)


Related Items

New Models for Computing the Distance of DMUs to the Weak Efficient Boundary of Convex and Nonconvex PPSs in DEA, Unnamed Item, A New MIP Approach on the Least Distance Problem in DEA, Variables reduction in data envelopment analysis, On how to properly calculate the Euclidean distance-based measure in DEA, Data envelopment analysis with common weights: the weight restriction approach, Closest reference point on the strong efficient frontier in data envelopment analysis, An integrated data envelopment analysis and simulation method for group consensus ranking, Finding closest target for bank branches in the presence of weight restrictions using data envelopment analysis, Determining closest targets on the extended facet production possibility set in data envelopment analysis: modeling and computational aspects, Benchmarking in data envelopment analysis: an approach based on genetic algorithms and parallel programming, A cross-bargaining game approach for direction selection in the directional distance function, A well-defined efficiency measure for dealing with closest targets in DEA



Cites Work

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3066915&oldid=16121432"
Powered by MediaWiki