A procedure for large-scale DEA computations

檔案

日期

2009-06-01

期刊名稱

COMPUTERS & OPERATIONS RESEARCH

摘要

Data envelopment analysis (DEA), a performance evaluation method, measures the relative efficiency of a particular decision making unit (DMU) against a peer group. Most popular DEA models can be solved using standard linear programming (LP) techniques and therefore, in theory, are considered as computationally easy. However, in practice, the computational load cannot be neglected for large-scale-in terms of number of DMUs-problems. This study proposes an accelerating procedure that properly identifies a few "similar" critical DMUs to compute DMU efficiency scores in a given set. Simulation results demonstrate that the proposed procedure is suitable for solving large-scale BCC problems when the percentage of efficient DMUs is high. The computational benefits of this procedure are significant especially when the number of inputs and outputs is small, which are most widely reported in the literature and practices. (C) 2008 Elsevier Ltd. All rights reserved.

所屬典藏

期刊論文
顯示完整詮釋資料 統計資料