A LINEAR BILEVEL PROGRAMMING PROBLEM FOR OBTAINING THE CLOSEST TARGETS AND MINIMUM DISTANCE OF A UNIT FROM THE STRONG EFFICIENT FRONTIER

DOI10.1142/S021759591250011XzbMath1246.90101OpenAlexW2024826662MaRDI QIDQ2911575

Gholam Reza Jahanshahloo, Javad Vakili, Masoud 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

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

Related Items (5)

Target setting in data envelopment analysis: efficiency improvement models with predefined inputs/outputs ⋮ Unnamed Item ⋮ Finding the closest efficient targets in DEA by a numeration method: the FDH non-convex technology ⋮ Finding closest target for bank branches in the presence of weight restrictions using data envelopment analysis ⋮ A modified distance friction minimization approach in data envelopment analysis

Cites Work

• Unnamed Item
• Some Models for Estimating Technical and Scale Inefficiencies in Data Envelopment Analysis
• Measuring the efficiency of decision making units
• A linear bilevel programming algorithm based on bicriteria programming
• The relevance of DEA benchmarking information and the least-distance measure: comment
• An extended branch and bound algorithm for linear bilevel programming
• Review of ranking methods in the data envelopment analysis context
• Foundations of bilevel programming
• An extended Kuhn-Tucker approach for linear bilevel programming
• A complete efficiency ranking of decision making units in data envelopment analysis
• A penalty function method based on Kuhn-Tucker condition for solving linear bilevel programming
• 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
• A new approach for solving linear bilevel problems using genetic algorithms
• Optimal Estimation of Executive Compensation by Linear Programming
• Determining a sequence of targets in DEA
• A Procedure for Ranking Efficient Units in Data Envelopment Analysis
• A comment on multi-stage DEA methodology
• From efficiency measurement to efficiency improvement: The choice of a relevant benchmark

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