Finding the strong efficient frontier and strong defining hyperplanes of production possibility set using multiple objective linear programming

Data envelopment analysis (DEA) models use the frontier of the production possibility set (PPS) to evaluate decision making units (DMUs). However, the explicit-form equations of the frontier cannot be obtained using the traditional DEA models. To fill this gap, the current paper proposes an algorith...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Operational research Ročník 22; číslo 1; s. 165 - 198
Hlavní autoři: Ghazi, Amineh, Hosseinzadeh Lotfı, Farhad, Sanei, Masoud
Médium: Journal Article
Jazyk:angličtina
Vydáno: Berlin/Heidelberg Springer Berlin Heidelberg 01.03.2022
Springer Nature B.V
Témata:
Algorithms
Business and Management
Computational Intelligence
Data envelopment analysis
Decision making
Hyperplanes
Linear programming
Management Science
Multiple criterion
Operations Research
Operations Research/Decision Theory
Original Paper
Simplex method
Efficient frontier
Defining hyperplane
Multiple objective linear programming
Data envelopment analysis
ISSN:1109-2858, 1866-1505
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Data envelopment analysis (DEA) models use the frontier of the production possibility set (PPS) to evaluate decision making units (DMUs). However, the explicit-form equations of the frontier cannot be obtained using the traditional DEA models. To fill this gap, the current paper proposes an algorithm to generate all strong-efficient DMUs and the explicit-form equations of the strong-efficient frontier and the strong defining hyperplanes for the PPS with the variable returns to scale (VRS) technology. The algorithm is based on a multiple objective linear programming (MOLP) problem in the DEA methodology, which is solved through the multicriteria simplex method. Also, Isermann’s test is employed to specify strong-efficient nonbasic variables in each strong-efficient multicriteria simplex table. Before presenting the algorithm, a theoretical framework is introduced to characterize the relationships between the feasible region in the decision space of the MOLP problem and the PPS with the VRS technology. It is shown that the algorithm which has four phases is finitely convergent and has less computational complexity than other algorithms in the related literature. Finally, two examples are used to illustrate the algorithm.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1109-2858
1866-1505
DOI:10.1007/s12351-019-00542-9