%0 Journal Article
%T Merging DMUs Based on of the idea Inverse DEA
%J Iranian Journal of Optimization
%I Islamic Azad University, Rasht Branch
%Z 2588-5723
%A Zeinodin, Elaheh
%A Ghobadi, Saeid
%D 2019
%\ 12/01/2019
%V 11
%N 2
%P 77-84
%! Merging DMUs Based on of the idea Inverse DEA
%K Data Envelopment Analysis (DEA)
%K Efficiency
%K Inverse DEA
%K Multiple-Objective Programming (MOP)
%K Merging decision making units (DMUs)
%R
%X In this paper, we propose a novel method using multiple-objective programming problems to answer the following question: if among a group of decision making units (DMUs), a subset of DMUs are required to merge and form a new DMU with specific input/output levels and a predefined efficiency target, how much should be the outputs/inputs of the merged DMU? This question answered according to the concept of inverse DEA. Sufficient conditions are established for input/output-estimation of the merged DMU using multiple-objective programming problems. A numerical example with real data is presented to illustrate the goals of this paper.
%U http://ijo.iaurasht.ac.ir/article_542528_198a134dbee3dbfda6221638e04edd6c.pdf