Zobrazit minimální záznam

dc.contributor.authorToloo, Mehdi
dc.contributor.authorTavana, Madjid
dc.contributor.authorSantos-Arteaga, Francisco J.
dc.date.accessioned2019-10-08T11:46:54Z
dc.date.available2019-10-08T11:46:54Z
dc.date.issued2019
dc.identifier.citationCentral European Journal of Operations Research. 2019, vol. 27, issue 4, p. 887-904.cs
dc.identifier.issn1435-246X
dc.identifier.issn1613-9178
dc.identifier.urihttp://hdl.handle.net/10084/138816
dc.description.abstractThe 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.cs
dc.language.isoencs
dc.publisherSpringercs
dc.relation.ispartofseriesCentral European Journal of Operations Researchcs
dc.relation.urihttp://doi.org/10.1007/s10100-017-0510-ycs
dc.rights© Springer-Verlag GmbH Germany, part of Springer Nature 2017cs
dc.subjectdata envelopment analysiscs
dc.subjectcommon set of weightscs
dc.subjectmixed integer linear programmingcs
dc.subjectmost efficient DMUcs
dc.titleAn integrated data envelopment analysis and mixed integer non-linear programming model for linearizing the common set of weightscs
dc.typearticlecs
dc.identifier.doi10.1007/s10100-017-0510-y
dc.type.statusPeer-reviewedcs
dc.description.sourceWeb of Sciencecs
dc.description.volume27cs
dc.description.issue4cs
dc.description.lastpage904cs
dc.description.firstpage887cs
dc.identifier.wos000482948100001


Soubory tohoto záznamu

SouboryVelikostFormátZobrazit

K tomuto záznamu nejsou připojeny žádné soubory.

Tento záznam se objevuje v následujících kolekcích

Zobrazit minimální záznam