A linear bilevel programming problem for obtaining the closest targets and minimum distance of a unit from the strong efficient frontier
DOI10.1142/S021759591250011XzbMATH Open1246.90101OpenAlexW2024826662MaRDI QIDQ2911575FDOQ2911575
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
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
minimum distancedata envelopment analysis (DEA)closest targetslinear bilevel programming (LBP)strong efficient frontier
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)
Cites Work
- Some Models for Estimating Technical and Scale Inefficiencies in Data Envelopment Analysis
- Measuring the efficiency of decision making units
- Foundations of bilevel 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
- A Procedure for Ranking Efficient Units in Data Envelopment Analysis
- An extended branch and bound algorithm for linear bilevel programming
- The relevance of DEA benchmarking information and the least-distance measure
- From efficiency measurement to efficiency improvement: The choice of a relevant benchmark
- The relevance of DEA benchmarking information and the least-distance measure: comment
- Review of ranking methods in the data envelopment analysis context
- Optimal estimation of executive compensation by linear programming
- A complete efficiency ranking of decision making units in data envelopment analysis
- Title not available (Why is that?)
- A linear bilevel programming algorithm based on bicriteria programming
- A comment on multi-stage DEA methodology
- Determining a sequence of targets in DEA
- The \(K\)th-best approach for linear bilevel multifollower programming with partial shared variables among followers
Cited In (11)
- Finding the closest efficient targets in DEA by a numeration method: the FDH non-convex technology
- A modified distance friction minimization approach in data envelopment analysis
- Title not available (Why is that?)
- 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)
