<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE ArticleSet PUBLIC "-//NLM//DTD PubMed 2.7//EN" "https://dtd.nlm.nih.gov/ncbi/pubmed/in/PubMed.dtd">
<ArticleSet>
<Article>
<Journal>
<PublisherName>OICC Press</PublisherName>
<JournalTitle>International Journal of Mathematical Modelling &amp; Computations</JournalTitle>
<Issn>2228-6233</Issn>
<Volume>14</Volume>
<Issue>4</Issue>
<PubDate PubStatus="epublish">
<Year>2024</Year>
<Month>12</Month>
<Day>21</Day>
</PubDate>
</Journal>
<ArticleTitle>Finding the Most Efficient Unit in Data Envelopment Analysis</ArticleTitle>
<VernacularTitle></VernacularTitle>
<FirstPage>381</FirstPage>
<LastPage>393</LastPage>
<ELocationID EIdType="doi">10.71932/ijm.2024.1195399</ELocationID>
<Language>EN</Language>
<AuthorList>
<Author>
<FirstName>Abbas</FirstName>
<LastName>Ghomashi Langroudi</LastName>
<Affiliation>Department of mathematics, Kermanshah Branch, Islamic Azad University, Kermanshah, Iran</Affiliation>
<Identifier Source="ORCID"></Identifier>
</Author>
<Author>
<FirstName>Masomeh</FirstName>
<LastName>Abbasi Maleksari</LastName>
<Affiliation>Department of Applied Mathematics, Kermanshah Branch, Islamic Azad University, Kermanshah, Iran.</Affiliation>
<Identifier Source="ORCID"></Identifier>
</Author>
<Author>
<FirstName>Saeed</FirstName>
<LastName>Shahghobadi</LastName>
<Affiliation>Department of Applied Mathematics, Kermanshah Branch, Islamic Azad University, Kermanshah, Iran.</Affiliation>
<Identifier Source="ORCID"></Identifier>
</Author>
</AuthorList>
<PublicationType>Journal Article</PublicationType>
<History>
<PubDate PubStatus="received">
<Year>2024</Year>
<Month>12</Month>
<Day>21</Day>
</PubDate>
</History>
<Abstract>In data envelopment analysis, identifying the most efficient decision-making unit (DMU) is crucial for gaining insights into efficient DMUs. Various approaches have been suggested in the literature to determine the most efficient DMU in data envelopment analysis. These approaches aim to develop a model with enhanced discriminatory ability among DMUs. This study introduces a new model based on a common set of weights approach using mixed integer linear programming to select the most efficient DMU. The proposed model ensures that the efficiency score of only one DMU (the most efficient) is strictly greater than one, while the efficiency scores of other DMUs are less than or equal to one. This model demonstrates a strong discriminatory capability, enabling the full ranking of all DMUs with fewer constraints than models that allow complete ranking. To validate the proposed model and compare its performance with recent approaches, two numerical examples from the literature are utilized.</Abstract>
<ObjectList>
<Object Type="keyword">
<Param Name="value">Data envelopment analysis</Param>
</Object>
<Object Type="keyword">
<Param Name="value">Most efficient DMU</Param>
</Object>
<Object Type="keyword">
<Param Name="value">Mixed integer linear programming</Param>
</Object>
<Object Type="keyword">
<Param Name="value">ranking</Param>
</Object>
<Object Type="keyword">
<Param Name="value">Common set of weights.</Param>
</Object>
</ObjectList>
</Article>
</ArticleSet>