Finding DEA-efficient hyperplanes using MOLP efficient faces

DOI10.1016/J.CAM.2010.08.007MaRDI QIDQ609208zbMATH OpenOpenAlexFDO

Authors Farhad Hosseinzadeh Lotfi, G. R. Jahanshahloo, Mohammad Reza Mozaffari, Javad Gerami

Publication date 30 November 2010

Published in Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.cam.2010.08.007

zbMATH Keywords

linear programmingdata envelopment analysismultiple objective linear programming

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

• An MOLP based procedure for finding efficient units in DEA models
• Finding defining hyperplanes with variable returns to scale technology
• scientific article; zbMATH DE number 2156687
• Generating strong defining hyperplanes of the production possibility set in data envelopment analysis
• Decomposing the efficient frontier of the DEA production possibility set into a smallest number of convex polyhedrons by mixed integer programming

Cites work

• An algorithm based on facial decomposition for finding the efficient set in multiple objective linear programming
• Construction of all DEA efficient surfaces of the production possibility set under the Generalized Data Development Analysis model
• Finding strong defining hyperplanes of production possibility set
• Finding the piecewise linear frontier production function in data envelopment analysis
• Maximal descriptor set characterizations of efficient faces in multiple objective linear programming.
• Measuring the efficiency of decision making units
• Some Models for Estimating Technical and Scale Inefficiencies in Data Envelopment Analysis
• The set of all nondominated solutions in linear cases and a multicriteria simplex method

Cited in

(9)

• Controlled Envelopment by Face Extension in DEA
• The role of hyperplanes for characterizing suspicious units in DEA
• scientific article; zbMATH DE number 7312765 (Why is no real title available?)
• Finding all the strong and weak defining hyperplanes of PPS without solving any LPs
• An MOLP based procedure for finding efficient units in DEA models
• Finding defining hyperplanes with variable returns to scale technology
• Decomposing the efficient frontier of the DEA production possibility set into a smallest number of convex polyhedrons by mixed integer programming
• A new robust DEA method to recognize the anchor points in the presence of uncertain data
• Objective identification of technological returns to scale for data envelopment analysis models

This page was built for publication: Finding DEA-efficient hyperplanes using MOLP efficient faces

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