Benchmarking in data envelopment analysis: an approach based on genetic algorithms and parallel programming

DOI10.1155/2014/431749zbMATH Open1291.90136DBLPjournals/advor/AparicioLMP14OpenAlexW2084385597WikidataQ59047870 ScholiaQ59047870MaRDI QIDQ2248708FDOQ2248708

Authors: Juan Aparicio, Raul Martinez-Moreno, Jose J. López-Espín, Jesus T. Pastor 

Publication date: 27 June 2014

Published in: Advances in Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2014/431749

Recommendations

• scientific article; zbMATH DE number 7340807
• The relevance of DEA benchmarking information and the least-distance measure
• Seeking alternative DEA benchmarks
• Finding suitable benchmark for inefficient commercial bank branches, application of DEA
• scientific article; zbMATH DE number 6612271

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)

Cites Work

• Title not available (Why is that?)
• Automated empirical optimizations of software and the ATLAS project
• Some Models for Estimating Technical and Scale Inefficiencies in Data Envelopment Analysis
• Measuring the efficiency of decision making units
• An enhanced DEA Russell graph efficiency measure
• Title not available (Why is that?)
• Title not available (Why is that?)
• An extended set of FORTRAN basic linear algebra subprograms
• Hyper-Heuristics: An Emerging Direction in Modern Search Technology
• Metric distance function and profit: Some duality results
• A multi-stage methodology for the solution of orientated DEA models
• The relevance of DEA benchmarking information and the least-distance measure
• Title not available (Why is that?)
• From efficiency measurement to efficiency improvement: The choice of a relevant benchmark
• On measuring the inefficiency with the inner-product norm in data envelopment analysis
• The relevance of DEA benchmarking information and the least-distance measure: comment
• Finding the piecewise linear frontier production function in data envelopment analysis
• A comment on multi-stage DEA methodology
• Determining a sequence of targets in DEA
• Technical efficiency and distance to a reverse convex set
• On how to properly calculate the Euclidean distance-based measure in DEA
• Using the minimum distance of DMUs from the frontier of the PPS for evaluating group performance of DMUs in DEA
• A Euclidean distance-based measure of efficiency in data envelopment analysis

Cited In (2)

• Multidimensional frontier visualization based on optimization methods using parallel computations
• The relevance of DEA benchmarking information and the least-distance measure

Uses Software

• ATLAS
• LAPACK

This page was built for publication: Benchmarking in data envelopment analysis: an approach based on genetic algorithms and parallel programming

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