A note on simulating weights restrictions in DEA: an improvement of Thanassoulis and Allen's method

DOI10.1016/J.COR.2003.08.020zbMath1071.90549OpenAlexW2083983878MaRDI QIDQ707018

Majid Soleimani-damaneh, Gholam Reza Jahanshahloo

Publication date: 9 February 2005

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2003.08.020

zbMATH Keywords

DEALinear programmingEfficiencyWeights restrictions

Mathematics Subject Classification ID

Linear programming (90C05) Management decision making, including multiple objectives (90B50)

Related Items (8)

Cost efficiency analysis with ordinal data: a theoretical and computational view ⋮ Ratio-based RTS determination in weight-restricted DEA models ⋮ Improving envelopment in data envelopment analysis under variable returns to scale ⋮ On comparison of different sets of units used for improving the frontier in DEA models ⋮ On value efficiency ⋮ An effective computational attempt in DDEA ⋮ Linear transformations to decrease computational requirements of solving some known linear programming models ⋮ Improving the discrimination power and weights dispersion in the data envelopment analysis

Cites Work

• Some Models for Estimating Technical and Scale Inefficiencies in Data Envelopment Analysis
• Measuring the efficiency of decision making units
• Weights restrictions and value judgements in data envelopment analysis: Evolution, development and future directions
• Simulating Weights Restrictions in Data Envelopment Analysis by Means of Unobserved DMUs
• A Procedure for Ranking Efficient Units in Data Envelopment Analysis

This page was built for publication: A note on simulating weights restrictions in DEA: an improvement of Thanassoulis and Allen's method