A linear bilevel programming problem for obtaining the closest targets and minimum distance of a unit from the strong efficient frontier

DOI10.1142/S021759591250011XMaRDI QIDQ2911575zbMATH OpenOpenAlexFDO

Authors G. R. Jahanshahloo, J. Vakili, M. Zarepisheh

Publication date 31 August 2012

Published in Asia-Pacific Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s021759591250011x

zbMATH Keywords

minimum distancedata envelopment analysis (DEA)closest targetslinear bilevel programming (LBP)strong efficient frontier

Mathematics Subject Classification ID

Management decision making, including multiple objectives (90B50) Multi-objective and goal programming (90C29) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)

Recommendations

• Determining closest targets on the extended facet production possibility set in data envelopment analysis: modeling and computational aspects
• scientific article; zbMATH DE number 7340807
• A new MIP approach on the least distance problem in DEA
• Closest reference point on the strong efficient frontier in data envelopment analysis
• Determining a sequence of targets in DEA

Cites work

• scientific article; zbMATH DE number 2166303 (Why is no real title available?)
• A Procedure for Ranking Efficient Units in Data Envelopment Analysis
• A comment on multi-stage DEA methodology
• A complete efficiency ranking of decision making units in data envelopment analysis
• A linear bilevel programming algorithm based on bicriteria programming
• A new approach for solving linear bilevel problems using genetic algorithms
• A penalty function method based on Kuhn-Tucker condition for solving linear bilevel programming
• An extended Kuhn-Tucker approach for linear bilevel programming
• An extended branch and bound algorithm for linear bilevel programming
• Determining a sequence of targets in DEA
• Foundations of bilevel programming
• From efficiency measurement to efficiency improvement: The choice of a relevant benchmark
• Measuring the efficiency of decision making units
• Optimal estimation of executive compensation by linear programming
• Review of ranking methods in the data envelopment analysis context
• Some Models for Estimating Technical and Scale Inefficiencies in Data Envelopment Analysis
• The \(K\)th-best approach for linear bilevel multifollower programming with partial shared variables among followers
• The relevance of DEA benchmarking information and the least-distance measure
• The relevance of DEA benchmarking information and the least-distance measure: comment

Cited in

(11)

• A modified distance friction minimization approach in data envelopment analysis
• Finding the closest efficient targets in DEA by a numeration method: the FDH non-convex technology
• scientific article; zbMATH DE number 7340807 (Why is no real title available?)
• Finding closest target for bank branches in the presence of weight restrictions using data envelopment analysis
• Closest reference point on the strong efficient frontier in data envelopment analysis
• Finding target units in FDH model by least-distance measure model
• Target setting in data envelopment analysis: efficiency improvement models with predefined inputs/outputs
• Determining a sequence of targets in DEA
• Determining closest targets on the extended facet production possibility set in data envelopment analysis: modeling and computational aspects
• A well-defined efficiency measure for dealing with closest targets in DEA
• A new MIP approach on the least distance problem in DEA

This page was built for publication: A linear bilevel programming problem for obtaining the closest targets and minimum distance of a unit from the strong efficient frontier

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