Determining a sequence of targets in DEA

DOI10.1057/palgrave.jors.2601964zbMath1142.90425OpenAlexW1965703251MaRDI QIDQ3372536

No author found.

Publication date: 21 February 2006

Published in: Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1057/palgrave.jors.2601964

Mathematics Subject Classification ID

Management decision making, including multiple objectives (90B50)

Related Items (13)

A modified discrete Raiffa approach for efficiency assessment and target setting ⋮ Closest reference point on the strong efficient frontier in data envelopment analysis ⋮ USING THE MINIMUM DISTANCE OF DMUs FROM THE FRONTIER OF THE PPS FOR EVALUATING GROUP PERFORMANCE OF DMUs IN DEA ⋮ A LINEAR BILEVEL PROGRAMMING PROBLEM FOR OBTAINING THE CLOSEST TARGETS AND MINIMUM DISTANCE OF A UNIT FROM THE STRONG EFFICIENT FRONTIER ⋮ Target setting in data envelopment analysis: efficiency improvement models with predefined inputs/outputs ⋮ A compromise programming approach for target setting in DEA ⋮ Unnamed Item ⋮ A well-defined efficiency measure for dealing with closest targets in DEA ⋮ Benchmarking in data envelopment analysis: an approach based on genetic algorithms and parallel programming ⋮ Mixed-strategy Nash equilibrium in data envelopment analysis ⋮ Gradual technical and scale efficiency improvement in DEA ⋮ A cross-bargaining game approach for direction selection in the directional distance function ⋮ Estimating the degree of firms' input market power via data envelopment analysis: evidence from the global biotechnology and pharmaceutical industry

This page was built for publication: Determining a sequence of targets in DEA