A Linear Programming Relaxation DEA Model for Selecting a Single Efficient Unit with Variable RTS Technology

DOI10.17535/crorr.2021.0011zbMath1482.90100OpenAlexW4205302011MaRDI QIDQ5026169

Reza Akhlaghi, Mohsen Rostamy-Malkhalifeh, Alireza Amirteimoori, Sohrab Kordrostami

Publication date: 7 February 2022

Published in: Croatian Operational Research Review (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.17535/crorr.2021.0011

zbMATH Keywords

data envelopment analysis (DEA)relaxation problemmixed binary linear programming (MBLP)selection-based problemsingle efficient unit

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Some Models for Estimating Technical and Scale Inefficiencies in Data Envelopment Analysis
• Measuring the efficiency of decision making units
• A new integrated DEA model for finding most BCC-efficient DMU
• A polynomial-time algorithm for finding \(\varepsilon\) in DEA models
• On finding the most BCC-efficient DMU: a new integrated MIP-DEA model
• Selecting most efficient information system projects in presence of user subjective opinions: a DEA approach

This page was built for publication: A Linear Programming Relaxation DEA Model for Selecting a Single Efficient Unit with Variable RTS Technology