Finding DEA-efficient hyperplanes using MOLP efficient faces |
| |
Authors: | F Hosseinzadeh LotfiGR Jahanshahloo MR Mozaffari J Gerami |
| |
Institution: | a Department of Mathematics, Science and Research Branch, Islamic Azad University, Tehran, Iranb Department of Mathematics, Tarbiat Moallem University, Tehran, Iranc Department of Mathematics, Science and Research Branch, Islamic Azad University, Fars, Iran |
| |
Abstract: | This paper suggests a method for finding efficient hyperplanes with variable returns to scale the technology in data envelopment analysis (DEA) by using the multiple objective linear programming (MOLP) structure. By presenting an MOLP problem for finding the gradient of efficient hyperplanes, We characterize the efficient faces. Thus, without finding the extreme efficient points of the MOLP problem and only by identifying the efficient faces of the MOLP problem, we characterize the efficient hyperplanes which make up the DEA efficient frontier. Finally, we provide an algorithm for finding the efficient supporting hyperplanes and efficient defining hyperplanes, which uses only one linear programming problem. |
| |
Keywords: | Data envelopment analysis Multiple objective linear programming Linear programming |
本文献已被 ScienceDirect 等数据库收录! |
|