Related references
Note: Only part of the references are listed.The relevance of DEA benchmarking information and the Least-Distance Measure: Comment
Jesus T. Pastor et al.
MATHEMATICAL AND COMPUTER MODELLING (2010)
The relevance of DEA benchmarking information and the Least-Distance Measure
Chulwoo Baek et al.
MATHEMATICAL AND COMPUTER MODELLING (2009)
A new approach for solving linear bilevel problems using genetic algorithms
Herminia I. Calvete et al.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2008)
Closest targets and minimum distance to the Pareto-efficient frontier in DEA
Juan Aparicio et al.
JOURNAL OF PRODUCTIVITY ANALYSIS (2007)
The Kth-best approach for linear bilevel multifollower programming with partial shared variables among followers
Chenggen Shi et al.
APPLIED MATHEMATICS AND COMPUTATION (2007)
A penalty function method based on Kuhn-Tucker condition for solving linear bilevel programming
Yibing Lv et al.
APPLIED MATHEMATICS AND COMPUTATION (2007)
An extended branch and bound algorithm for linear bilevel programming
Chenggen Shi et al.
APPLIED MATHEMATICS AND COMPUTATION (2006)
Determining a sequence of targets in DEA
S Lozano et al.
JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY (2005)
An extended Kuhn-Tucker approach for linear bilevel programming
CG Shi et al.
APPLIED MATHEMATICS AND COMPUTATION (2005)
Finding closest targets in non-oriented DEA models: The case of convex and non-convex technologies
MCAS Portela et al.
JOURNAL OF PRODUCTIVITY ANALYSIS (2003)
Review of ranking methods in the data envelopment analysis context
N Adler et al.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2002)
From efficiency measurement to efficiency improvement:: The choice of a relevant benchmark
SE González et al.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2001)
A comment on multi-stage DEA methodology
L Cherchye et al.
OPERATIONS RESEARCH LETTERS (2001)
Share Paper
