A polynomial-time algorithm for finding \(\varepsilon\) in DEA models
type: Item
instance of: scholarly article
title: A polynomial-time algorithm for finding \(\varepsilon\) in DEA models
zbMATH Open document ID: 1106.90335
DOI: 10.1016/S0305-0548(03)00072-8
author: Gholam R. Amin
author: Mehdi Toloo
published in: Computers \& Operations Research
publication date: 2004-06-15T00:00:00Z
Mathematics Subject Classification ID: 90B50
Mathematics Subject Classification ID: 90C90
Mathematics Subject Classification ID: 68W40
zbMATH DE Number: 2075505
zbMATH Keywords: data envelopment analysis
zbMATH Keywords: non-Archimedean \(\varepsilon\)
zbMATH Keywords: polynomial time algorithm
Wikidata QID: Q57840823
MaRDI profile type: Publication
full work available at URL: s0305-0548(03)00072-8
OpenAlex ID: W178378613
DBLP publication ID: journals/cor/AminT04
Recommended article: An enumerative algorithm for solving nonconvex dynamic DEA models
Recommended article: An efficient approach for computing non-Archimedean \(\varepsilon\) in DEA based on integrated models
Recommended article: An epsilon-free approach for finding the most efficient unit in DEA
Recommended article: AN ε-FREE DEA AND A NEW MEASURE OF EFFICIENCY
Recommended article: DEA models for the explicit maximisation of relative efficiency
Recommended article: On some generalization of the DEA models
Recommended article: A Polynomial Time Algorithm for Computing an Arrow–Debreu Market Equilibrium for Linear Utilities
Recommended article: Q4666999
Recommended article: A new framework for the solution of DEA models
Recommended article: A procedure for large-scale DEA computations
description: scientific article; zbMATH DE number 2075505