A method for finding efficient DMUs in DEA using 0-1 linear programming
From MaRDI portal
Publication:702575
DOI10.1016/J.AMC.2003.08.144zbMATH Open1057.90027OpenAlexW1963643472MaRDI QIDQ702575FDOQ702575
Authors: N. Shoja, G. Tohidi, G. R. Jahanshahloo, Farhad Hosseinzadeh Lotfi
Publication date: 17 January 2005
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2003.08.144
Recommendations
- Using DEA to obtain efficient solutions for multi-objective 0--1 linear programs
- A METHOD FOR SOLVING 0-1 MULTIPLE OBJECTIVE LINEAR PROGRAMMING PROBLEM USING DEA
- Efficiency status of a feasible solution in the multi-objective integer linear programming problems: a DEA methodology
- A DEA approach to rank all efficient extreme and non extreme DMUs
- A method for solving 0-1 multiple objective programming problem, using data envelopment analysis technique
- On efficient solutions of 0-1 multi-objective linear programming problems
- Relationships between Pareto optimality in multi-objective 0-1 linear programming and DEA efficiency
- An epsilon-free approach for finding the most efficient unit in DEA
- Using lexicographic parametric programming for identifying efficient units in DEA
- Ranking efficient DMUs based on single virtual inefficient DMU in DEA
Cites Work
Cited In (4)
- A method for solving 0-1 multiple objective programming problem, using data envelopment analysis technique
- Using the minimum distance of DMUs from the frontier of the PPS for evaluating group performance of DMUs in DEA
- Discriminating efficient units using MAJ FDH
- A METHOD FOR SOLVING 0-1 MULTIPLE OBJECTIVE LINEAR PROGRAMMING PROBLEM USING DEA
This page was built for publication: A method for finding efficient DMUs in DEA using 0-1 linear programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q702575)