An integrated data envelopment analysis and mixed integer non-linear programming model for linearizing the common set of weights

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27510%2F19%3A10240311" target="_blank" >RIV/61989100:27510/19:10240311 - isvavai.cz</a>

Výsledek na webu

<a href="https://link.springer.com/article/10.1007/s10100-017-0510-y" target="_blank" >https://link.springer.com/article/10.1007/s10100-017-0510-y</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1007/s10100-017-0510-y" target="_blank" >10.1007/s10100-017-0510-y</a>

Jazyk výsledku

angličtina

Název v původním jazyce

An integrated data envelopment analysis and mixed integer non-linear programming model for linearizing the common set of weights

Popis výsledku v původním jazyce

The problem of ranking efficient decision making units (DMUs) is of interest from both theoretical and practical points of view. In this paper, we propose an integrated data envelopment analysis and mixed integer non-linear programming (MINLP) model to find the most efficient DMU using a common set of weights. We linearize the MINLP model to an equivalent mixed integer linear programming (MILP) model by eliminating the non-linear constraints in which the products of variables are incorporated. The formulated MILP model is simpler and computationally more efficient. In addition, we introduce a model for finding the value of epsilon, since the improper choice of the non-Archimedean epsilon may result in infeasible conditions. We use a real-life facility layout problem to demonstrate the applicability and exhibit the efficacy of the proposed model.

Název v anglickém jazyce

An integrated data envelopment analysis and mixed integer non-linear programming model for linearizing the common set of weights

Popis výsledku anglicky

The problem of ranking efficient decision making units (DMUs) is of interest from both theoretical and practical points of view. In this paper, we propose an integrated data envelopment analysis and mixed integer non-linear programming (MINLP) model to find the most efficient DMU using a common set of weights. We linearize the MINLP model to an equivalent mixed integer linear programming (MILP) model by eliminating the non-linear constraints in which the products of variables are incorporated. The formulated MILP model is simpler and computationally more efficient. In addition, we introduce a model for finding the value of epsilon, since the improper choice of the non-Archimedean epsilon may result in infeasible conditions. We use a real-life facility layout problem to demonstrate the applicability and exhibit the efficacy of the proposed model.

Druh

J_imp - Článek v periodiku v databázi Web of Science

CEP obor

—

OECD FORD obor

10102 - Applied mathematics

Projekt

Výsledek vznikl pri realizaci vícero projektů. Více informací v záložce Projekty.

Návaznosti

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Rok uplatnění

2019

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název periodika

Central European Journal of Operations Research

ISSN

1435-246X

e-ISSN

—

Svazek periodika

27

Číslo periodika v rámci svazku

4

Stát vydavatele periodika

US - Spojené státy americké

Počet stran výsledku

18

Strana od-do

887-904

Kód UT WoS článku

000482948100001

EID výsledku v databázi Scopus

2-s2.0-85037150456