Author/Authors :
Bani, Ali Akbar Science and Research Branch, Islamic Azad University, Tehran, Iran , Rostamy-Malkhalifeh, Mohsen Science and Research Branch, Islamic Azad University, Tehran, Iran , Hosseinzadeh Lotfi, Farhad Science and Research Branch, Islamic Azad University, Tehran, Iran , Akbarian, Dariush Arak branch, Islamic Azad University, Arak, Iran
Abstract :
Anchor points are an important subset of the set of extreme efficient points of the Production Possibility Set (PPS) in the Data Envelopment Analysis (DEA). They delineate the efficient from the inefficient part of the PPS frontier. In this paper we present a method to find anchor points of the PPS of the BCC model based on searching weak supporting hyperplane passing through unit under consideration. Then, one theorem is proved creating necessary and sufficient condition for identification of these points. Using numerical examples, we will demonstrate how to use the results.
Keywords :
Data Envelopment Analysis , Anchor point , Extreme point , Mixed integer linear programming
