Abstract
In the original DEA/CCR (Data Envelopment Analysis/Charnes, Cooper and Rhodes) computation with n DMUs (Decision Making Units), we cannot make do with solving n LP (Linear Programmiing) problems even to judge only whether each DMU is DEA efficient or not in using ordinary LP solvers. This is because we must use two-phase optimization unless we have access to DEA software packages taking non-Archimedean infinitesimals into consideration. We must solve n Phase I LPs for all the n DMUs plus Phase II LPs to see whether DEA inefficient DMUs on the extended frontier are. This paper shows that, through solving nearly n LPs, we can achieve it if we use the DEA exclusion model instead of the standard DEA model, etc. We should note a merit of the DEA exclusion model for reducing DEA computation load as well.
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 callMore From: Journal of the Operations Research Society of Japan
Disclaimer: 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.
