Some comments on Russell graph efficiency measures in data envelopment analysis: the multiplicative approach
From MaRDI portal
Publication:2106765
DOI10.1016/j.ejor.2022.11.004OpenAlexW4308742844MaRDI QIDQ2106765
Israfil Roshdi, Dimitris Margaritis, Mostafa Naghavi, Amir Arjomandi
Publication date: 19 December 2022
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2022.11.004
data envelopment analysissecond order cone programmingDC optimisationreverse convex optimisationRussell graph efficiency measure
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Foundations of data envelopment analysis for Pareto-Koopmans efficient empirical production functions
- Convex programs with an additional reverse convex constraint
- An enhanced DEA Russell graph efficiency measure
- DC programming and DCA: thirty years of developments
- DC programming: overview.
- A unified approach to non-radial graph models in data envelopment analysis: common features, geometry, and duality
- Russell graph efficiency measures in data envelopment analysis: the multiplicative approach
- Benefit and distance functions
- Developing a decomposable measure of profit efficiency using DEA
- The Validity of a Family of Optimization Methods
- A slacks-based measure of efficiency in data envelopment analysis
This page was built for publication: Some comments on Russell graph efficiency measures in data envelopment analysis: the multiplicative approach