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

No Thumbnail Available

Access rights

embargoedAccess

URL

Journal Title

Journal ISSN

Volume Title

A1 Alkuperäisartikkeli tieteellisessä aikakauslehdessä
This publication is imported from Aalto University research portal.
View publication in the Research portal (opens in new window)
Embargo ends: 2026-12-12

Other link related to publication (opens in new window)

Date

2024-12-12

Major/Subject

Mcode

Degree programme

Language

en

Pages

Series

European Journal of Operational Research

Abstract

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.

Description

Publisher Copyright: © 2024 Elsevier B.V.

Keywords

Data envelopment analysis (DEA), Decision models, Multiple-objective programming, Ordering cone, Pareto solution, Weight restrictions

Other note

Citation

Korhonen, P, Soleimani-Damaneh, M & Wallenius, J 2024, ' Connections between multiple-objective programming and weight restricted data envelopment analysis : The role of the ordering cone ', European Journal of Operational Research . https://doi.org/10.1016/j.ejor.2024.12.002