logo
CanyamAI summaries for academic research
language
MobileMobile
  • Phone FeatureWeChat Mini Program
EnglishEnglish
noticeNotice
BlogBlog
delete
arrow
Return

A method for finding efficient DMUs in DEA using 0-1 linear programming

delete2004-11-01
delete2
PRE
AI
G
G.R. Jahanshahloo *
F
Farhad Hosseinzadeh Lotfı
N
N. Shoja
G
Ghasem Tohidi
DOI：10.1016/j.amc.2003.08.144delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
In this paper, by using 0-1 linear programming a method is proposed to find efficient decision making units (DMUs). In proposed method, we put aside the production possibility set principles of the data envelopment analysis (DEA) models and only consider the observations set. The presented method compares each DMU with observed DMUs and identifies the efficient DMUs. This method consists of a one-stage algorithm. In each iteration of this algorithm, by solving a 0-1 linear programming problem, at least one efficient DMU is identified. (C) 2003 Published by Elsevier Inc.
Keywords:
data envelopment analysis
free disposal hull
0-1 linear programming

Journal

Applied Mathematics and Computation cover
Applied Mathematics and Computation
IF:
3.4
Papers:
2.3W
Citations:
3.3W

Organization

No organization information available