An MOLP based procedure for finding efficient units in DEA models

被引:13
|
作者
Lotfi, F. Hosseinzadeh [1 ]
Noora, A. A. [2 ]
Jahanshahloo, G. R. [3 ]
Jablonsky, J. [4 ]
Mozaffari, M. R. [1 ]
Gerami, J. [1 ]
机构
[1] Islamic Azad Univ, Dept Math, Sci & Res Branch, Tehran, Iran
[2] Univ Sistan & Baluchestan, Dept Math, Zahedan, Iran
[3] Tarbiat Moallem Univ, Dept Math, Tehran, Iran
[4] Univ Econ Prague, Dept Econometr, Prague, Czech Republic
关键词
Data envelopment analysis; Multiple objective linear programming; Linear programming; DATA ENVELOPMENT ANALYSIS; DECISION-MAKING UNITS; RESTRICTIONS;
D O I
10.1007/s10100-008-0071-1
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
In this paper a multiple objective linear programming (MOLP) problem whose feasible region is the production possibility set with variable returns to scale is proposed. By solving this MOLP problem by multicriterion simplex method, the extreme efficient Pareto points can be obtained. Then the extreme efficient units in data envelopment analysis (DEA) with variable returns to scale, considering the specified theorems and conditions, can be obtained. Therefore, by solving the proposed MOLP problem, the non-dominant units in DEA can be found. Finally, a numerical example is provided.
引用
收藏
页码:1 / 11
页数:11
相关论文
共 50 条