Connections between multiple-objective programming and weight restricted data envelopment analysis: The role of the ordering cone

This paper explores some new, important and interesting connections between Multiple-Objective Programming (MOP) and Data Envelopment Analysis (DEA). We show that imposing weight restrictions in DEA corresponds to changing the ordering cone in MOP in a specific way. The new ordering cone is construc...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:European journal of operational research Ročník 323; číslo 2; s. 571 - 582
Hlavní autoři: Korhonen, Pekka, Soleimani-damaneh, Majid, Wallenius, Jyrki
Médium: Journal Article
Jazyk:angličtina
Vydáno: Elsevier B.V 01.06.2025
Témata:
ISSN:0377-2217
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í:This paper explores some new, important and interesting connections between Multiple-Objective Programming (MOP) and Data Envelopment Analysis (DEA). We show that imposing weight restrictions in DEA corresponds to changing the ordering cone in MOP in a specific way. The new ordering cone is constructed and its properties are proved, providing useful insights about the connections between MOP and DEA. After providing several theoretical results, we illustrate them on a real-world data set. In addition to their theoretical appeal, our results hold significant practical importance for several reasons which are addressed in the paper. •Exploring novel and significant connections between MOP and WR-DEA.•Demonstrating that applying WRs in DEA corresponds to changing the ordering cone in MOP in a specific way.•Constructing the new ordering cone and establishing its properties.•Applying the theory to a real-world data set, providing practical illustrations.•Discussing the practical and applied significance of our results.
ISSN:0377-2217
DOI:10.1016/j.ejor.2024.12.002