Network Design for Express Shipment Delivery
Computational Optimization and Applications
A polynomial-time algorithm for finding ɛ in DEA models
Computers and Operations Research
Finding the most efficient DMUs in DEA: An improved integrated model
Computers and Industrial Engineering
Cost efficiency analysis with ordinal data: a theoretical and computational view
International Journal of Computer Mathematics
A robust optimization approach for imprecise data envelopment analysis
Computers and Industrial Engineering
Minimizing deviations of input and output weights from their means in data envelopment analysis
Computers and Industrial Engineering
Cross efficiency evaluation method based on weight-balanced data envelopment analysis model
Computers and Industrial Engineering
A bargaining game model for efficiency decomposition in the centralized model of two-stage systems
Computers and Industrial Engineering
Computers and Industrial Engineering
| Hi-index | 0.00 |
This paper clarifies the role of non-Archimedean infinitesimal e in DEA models so that the associated linear programs may be infeasible (for the multiplier side) and unbounded (for the envelopment side) for certain values of e. It is shown that the bound of e proposed by Ali and Seiford (1993) is invalid for feasibility and boundedness of the linear programs. A procedure is presented for determining an assurance interval of e. It is also shown that an assurance value for e can be found using a single linear program.