Accelerating the identification of efficient frontier for large-scale data envelopment analysis

DOI10.15807/JORSJ.68.59MaRDI QIDQ6985655zbMATH OpenFDO

Authors Hiroshi Morita

Publication date 12 May 2025

Published in Journal of the Operations Research Society of Japan (Search for Journal in Brave)

Full work available at URL https://doi.org/10.15807/JORSJ.68.59

zbMATH Keywords

DEAlarge-scale datasetalgorithmic geometryconvex frontier

Mathematics Subject Classification ID

Management decision making, including multiple objectives (90B50) Decision theory (91B06) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)

Cites work

• A response to comments on `Modeling undesirable factors in efficiency evaluation'.
• An algorithm for data envelopment analysis
• Big data efficiency analysis: improved algorithms for data envelopment analysis involving large datasets
• 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
• Modeling undesirable factors in efficiency evaluation
• Output-input ratio analysis and DEA frontier
• Parallel and hierarchical decomposition approaches for solving large-scale data envelopment analysis models
• Parallel processing of the Build Hull algorithm to address the large-scale DEA problem
• 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 the identification of efficient frontier for large-scale data envelopment analysis

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