Accelerating large-scale DEA computation using sequential categorization and dynamic reference set selection

DOI10.1080/03155986.2024.2406121MaRDI QIDQ6974186zbMATH OpenFDO

Authors Dariush Khezrimotlagh, Hiroshi Morita

Publication date 10 June 2025

Published in INFOR: Information Systems and Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/03155986.2024.2406121

Mathematics Subject Classification ID

Management decision making, including multiple objectives (90B50) Linear programming (90C05) Reliability, availability, maintenance, inspection in operations research (90B25) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)

Cites work

• A general computational framework and a hybrid algorithm for large-scale data envelopment analysis
• A procedure for large-scale DEA computations
• An algorithm for data envelopment analysis
• Data envelopment analysis and big data
• Determining radial efficiency with a large data set by solving small-size linear programs
• Measuring the efficiency of decision making units
• Output-input ratio analysis and DEA frontier
• Parallel and hierarchical decomposition approaches for solving large-scale data envelopment analysis models
• Preprocessing DEA
• Some Models for Estimating Technical and Scale Inefficiencies in Data Envelopment Analysis
• Streamlined computation for data envelopment analysis

This page was built for publication: Accelerating large-scale DEA computation using sequential categorization and dynamic reference set selection

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