Finding DEA-efficient hyperplanes using MOLP efficient faces

DOI10.1016/j.cam.2010.08.007zbMath1200.90148OpenAlexW2096901526MaRDI QIDQ609208

Mohammad Reza Mozaffari, Gholam Reza Jahanshahloo, Farhad Hosseinzadeh Lotfi, 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

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 (4)

Unnamed Item ⋮ Unnamed Item ⋮ Objective identification of technological returns to scale for data envelopment analysis models ⋮ Unnamed Item

Cites Work

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

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