##
**On measuring the inefficiency with the inner-product norm in data envelopment analysis.**
*(English)*
Zbl 0981.90056

Summary: A technique for assessing the sensitivity of efficiency classifications in data envelopment analysis is presented. It extends the technique proposed by A. Charnes, J. J. Rousseau, and J. H. Semple, [J. Productivity Analysis 7, 5-18 (1996)]. An organization’s input-output vector serves as the center for a cell within which the organization’s classification remains unchanged under perturbations of the data. The maximal radius among such cells can be interpreted as a stability measure of the classification. Our approach adopts the inner-product norm for the radius, while the previous work does the polyhedral norms. For an efficient organization, the maximal-radius problem is a convex program. On the other hand, for an inefficient organization, it is reduced to a nonconvex program whose feasible region is the complement of a convex polyhedral set. We show that the latter nonconvex problem can be transformed into a linear reverse convex program. Our formulations and algorithms are valid not only in the CCR model but in its variants.

### Keywords:

data envelopment analysis; sensitivity analysis; global optimization; linear reverse convex program
PDF
BibTeX
XML
Cite

\textit{A. Takeda} and \textit{H. Nishino}, Eur. J. Oper. Res. 133, No. 2, 377--393 (2001; Zbl 0981.90056)

Full Text:
DOI

### References:

[1] | Banker, R.D.; Charnes, A.; Cooper, W.W., Some models for estimating technical and scale inefficiencies in data envelopment analysis, Management science, 30, 1078-1092, (1984) · Zbl 0552.90055 |

[2] | H.P. Benson, Concave Minimization: Theory applications and algorithms, in: R. Horst, P.M. Pardalos (Eds.), Handbook of Global Optimization, Kluwer Academic Publishers, Dordrecht, 1995, pp. 43-148 · Zbl 0821.90096 |

[3] | Cabot, A.V., Variations on a cutting plane method for solving concave minimization problem with linear constraints, Naval research logistics quarterly, 21, 265-274, (1974) · Zbl 0348.90131 |

[4] | Charnes, A.; Cooper, W.W.; Rhodes, E., Measuring the efficiency of decision making units, European journal of operational research, 2, 429-444, (1978) · Zbl 0416.90080 |

[5] | Charnes, A.; Neralic, L., Sensitivity analysis of the additive model in data envelopment analysis, European journal of operational research, 48, 332-341, (1990) · Zbl 0724.90001 |

[6] | Charnes, A.; Rousseau, J.J.; Semple, J.H., Sensitivity and stability of efficiency classifications in data envelopment analysis, Journal of productivity analysis, 7, 5-18, (1996) |

[7] | R. Horst, H. Tuy, Global Optimization (Deterministic Approaches), third ed., Springer, Berlin, 1995 · Zbl 0704.90057 |

[8] | Li, S.X., Stochastic models and variable returns to scales in data envelopment analysis, European journal of operational research, 104, 532-548, (1998) · Zbl 0960.90508 |

[9] | Majthay, A.; Whinston, A., Quasi-concave minimization, Discrete mathematics, 9, 35-59, (1974) · Zbl 0301.90037 |

[10] | H. Morita, L.M. Seiford, Characteristics on Stochastic Efficiency, Working Paper (unpublished), 1998 |

[11] | Olesen, O.B.; Petersen, N.C., Chance constrained efficiency evaluation, Management science, 41, 442-457, (1995) · Zbl 0833.90004 |

[12] | Seiford, L.M.; Thrall, R.M., Recent development in DEA: the mathematical approach to frontier analysis, Journal of econometrics, 46, 7-38, (1990) · Zbl 0716.90015 |

[13] | Seiford, L.M.; Zhu, J., Stability regions for maintaining efficiency in data envelopment analysis, European journal of operational research, 108, 127-139, (1998) · Zbl 0943.90052 |

[14] | Tulkens, H., On FDH efficiency analysis: some methodological issues and applications to retail banking, courts, and urban transit, Journal of productivity analysis, 4, 183-210, (1993) |

[15] | Tuy, H., Concave programming under linear constraints, Soviet mathematic, 5, 1437-1440, (1964) · Zbl 0132.40103 |

This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.