A computational study of DEA with massive data sets
type: Item
instance of: scholarly article
title: A computational study of DEA with massive data sets
zbMATH Open document ID: 1157.90479
published in: Computers \& Operations Research
publication date: 2008-09-01T00:00:00Z
Mathematics Subject Classification ID: 90C05
Mathematics Subject Classification ID: 90C90
zbMATH DE Number: 5318746
zbMATH Keywords: data envelopment analysis (DEA)
zbMATH Keywords: linear programming
zbMATH Keywords: convex analysis
author: José H. Dulá
describes a project that uses: CPLEX
MaRDI profile type: Publication
full work available at URL: j.cor.2006.07.011
OpenAlex ID: W1974899953
cites work: Measuring the efficiency of decision making units
cites work: Parallel and hierarchical decomposition approaches for solving large-scale data envelopment analysis models
cites work: Some Models for Estimating Technical and Scale Inefficiencies in Data Envelopment Analysis
cites work: Foundations of data envelopment analysis for Pareto-Koopmans efficient empirical production functions
cites work: Nonparametric frontier analysis with multiple constituencies
cites work: Streamlined computation for data envelopment analysis
cites work: Effects of excluding the column being scored from the DEA envelopment LP technology matrix
cites work: Algorithms for the frame of a finitely generated unbounded polyhedron
cites work: A slacks-based measure of efficiency in data envelopment analysis
cites work: Q3250135
cites work: An effective non-Archimedean anti-degeneracy/cycling linear programming method especially for data envelopment analysis and like models
cites work: Q3844775
cites work: Solving Real-World Linear Programs: A Decade and More of Progress
DOI: 10.1016/J.COR.2006.07.011
description: scientific article; zbMATH DE number 5318746