Some comments on Russell graph efficiency measures in data envelopment analysis: the multiplicative approach

DOI10.1016/J.EJOR.2022.11.004OpenAlexW4308742844MaRDI QIDQ2106765FDOQ2106765

Authors: Mostafa Naghavi, I. Roshdi, Amir Arjomandi, Dimitris Margaritis 

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

zbMATH Keywords

data envelopment analysissecond order cone programmingDC optimisationreverse convex optimisationRussell graph efficiency measure

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites Work

• DC programming: overview.
• Title not available (Why is that?)
• Foundations of data envelopment analysis for Pareto-Koopmans efficient empirical production functions
• An enhanced DEA Russell graph efficiency measure
• Benefit and distance functions
• A slacks-based measure of efficiency in data envelopment analysis
• Developing a decomposable measure of profit efficiency using DEA
• The Validity of a Family of Optimization Methods
• Convex programs with an additional reverse convex constraint
• DC programming and DCA: thirty years of developments
• Russell graph efficiency measures in data envelopment analysis: the multiplicative approach
• Finding common ground: efficiency indices
• A unified approach to non-radial graph models in data envelopment analysis: common features, geometry, and duality

Cited In (1)

• Multiplicative aggregation of division efficiencies in network data envelopment analysis

Uses Software

• Matlab
• CVX
• Mosek

This page was built for publication: Some comments on Russell graph efficiency measures in data envelopment analysis: the multiplicative approach

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2106765)