Abstract
The full dimensional efficient facets (FDEFs) of a production possibility set (PPS) play a key role in data envelopment analysis (DEA). Finding the FDEFs has been the subject of intensive research over the past decade. The available algorithms for finding the FDEFs in the current DEA literature either require information about the position of all the extreme efficient decision-making units on the facets of the PPS or knowledge of all extreme optimal solutions of the multiplier form of the BCC model. In this article, we develop an algorithm that does not require such crucial information that may not be easily available. To this purpose, we first carefully analyse the structure of the FDEFs of PPS with BCC technology, using basic concepts of polyhedral set theory. We then utilize this information to devise an algorithm for finding the FDEFs, using mixed integer linear programming. We illustrate our algorithm using a set of real data.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
