Solving the Bi-Objective Integer Programming: A DEA methodology

Finding and classifying all efficient solutions for a Bi-Objective Integer Linear Programming (BOILP) problem is one of the controversial issues in Multi-Criteria Decision Making problems. The main aim of this study is to utilize the well-known Data Envelopment Analysis (DEA) methodology to tackle t...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:2014 International Conference on Control, Decision and Information Technologies (CoDIT) s. 060 - 064
Hlavní autori: Keshavarz, Esmaiel, Toloo, Mehdi
Médium: Konferenčný príspevok..
Jazyk:English
Vydavateľské údaje: IEEE 01.11.2014
Predmet:
Algorithm design and analysis
Artificial intelligence
Bi-Objective Integer Linear Programming
Computational modeling
Data envelopment analysis
Decision making
Efficient solution
Non-dominated point
Supported efficient solution
Vectors
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Abstract Finding and classifying all efficient solutions for a Bi-Objective Integer Linear Programming (BOILP) problem is one of the controversial issues in Multi-Criteria Decision Making problems. The main aim of this study is to utilize the well-known Data Envelopment Analysis (DEA) methodology to tackle this issue. Toward this end, we first state some propositions to clarify the relationships between the efficient solutions of a BOILP and efficient Decision Making Units (DMUs) in DEA and next design a new two-stage approach to find and classify a set of efficient solutions. Stage I formulates a two-phase Mixed Integer Linear Programming (MILP) model, based on the Free Disposal Hull (FDH) model in DEA, to gain a Minimal Complete Set of efficient solutions. Stage II uses a variable returns to scale DEA model to classify the obtained efficient solutions from Stage I as supported and non-supported. A BOILP model containing 6 integer variables and 4 constraints is solved as an example to illustrate the applicability of the proposed approach.
AbstractList Finding and classifying all efficient solutions for a Bi-Objective Integer Linear Programming (BOILP) problem is one of the controversial issues in Multi-Criteria Decision Making problems. The main aim of this study is to utilize the well-known Data Envelopment Analysis (DEA) methodology to tackle this issue. Toward this end, we first state some propositions to clarify the relationships between the efficient solutions of a BOILP and efficient Decision Making Units (DMUs) in DEA and next design a new two-stage approach to find and classify a set of efficient solutions. Stage I formulates a two-phase Mixed Integer Linear Programming (MILP) model, based on the Free Disposal Hull (FDH) model in DEA, to gain a Minimal Complete Set of efficient solutions. Stage II uses a variable returns to scale DEA model to classify the obtained efficient solutions from Stage I as supported and non-supported. A BOILP model containing 6 integer variables and 4 constraints is solved as an example to illustrate the applicability of the proposed approach.
Author Keshavarz, Esmaiel
Toloo, Mehdi
Author_xml – sequence: 1
  givenname: Esmaiel
  surname: Keshavarz
  fullname: Keshavarz, Esmaiel
  email: esmailk212@gmail.com
  organization: Dept. of Math., Islamic Azad Univ., Tehran, Iran
– sequence: 2
  givenname: Mehdi
  surname: Toloo
  fullname: Toloo, Mehdi
  email: mehdi.toloo@vsb.cz
  organization: Fac. of Econ., Tech. Univ. of Ostrava, Ostrava, Czech Republic
BookMark eNotj11LwzAYRiPohW77A3qTP9CaNE2a1xup3dTCYAN7P_Lxtou0jdQy2L934K4eDhwOPA_kdowjEvLIWco5g-cqrusmzRjPUwWgtNI3ZAWF5nlxwaIQ8p68fsX-FMaOzkekbyHZ2W90czghrccZO5zofordZIbhIr3Qkq43JR1wPkYf-9idl-SuNf0vrq67IM37pqk-k-3uo67KbRKAzYmzyqPUSlrtnWdMgGmtEw6MFJBxcJ47IVupuMwB28yjzUTrUIPjlhkrFuTpPxsQ8fAzhcFM58P1lfgDi7VG2A
ContentType Conference Proceeding
DBID 6IE
6IL
CBEJK
RIE
RIL
DOI 10.1109/CoDIT.2014.6996868
DatabaseName IEEE Electronic Library (IEL) Conference Proceedings
IEEE Xplore POP ALL
IEEE Xplore All Conference Proceedings
IEEE/IET Electronic Library
IEEE Proceedings Order Plans (POP All) 1998-Present
DatabaseTitleList
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Electronic Library (IEL)
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
EISBN 9781479967735
1479967734
EndPage 064
ExternalDocumentID 6996868
Genre orig-research
GroupedDBID 6IE
6IL
CBEJK
RIE
RIL
ID FETCH-LOGICAL-i90t-cb6de5865b8dcd0039afbc3c9a539219cd1c35f561549ef2deb23fce89c1b0ab3
IEDL.DBID RIE
IngestDate Thu Jun 29 18:37:40 EDT 2023
IsPeerReviewed false
IsScholarly false
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-i90t-cb6de5865b8dcd0039afbc3c9a539219cd1c35f561549ef2deb23fce89c1b0ab3
PageCount 5
ParticipantIDs ieee_primary_6996868
PublicationCentury 2000
PublicationDate 2014-Nov.
PublicationDateYYYYMMDD 2014-11-01
PublicationDate_xml – month: 11
  year: 2014
  text: 2014-Nov.
PublicationDecade 2010
PublicationTitle 2014 International Conference on Control, Decision and Information Technologies (CoDIT)
PublicationTitleAbbrev CoDIT
PublicationYear 2014
Publisher IEEE
Publisher_xml – name: IEEE
Score 1.5520306
Snippet Finding and classifying all efficient solutions for a Bi-Objective Integer Linear Programming (BOILP) problem is one of the controversial issues in...
SourceID ieee
SourceType Publisher
StartPage 060
SubjectTerms Algorithm design and analysis
Artificial intelligence
Bi-Objective Integer Linear Programming
Computational modeling
Data envelopment analysis
Decision making
Efficient solution
Non-dominated point
Supported efficient solution
Vectors
Title Solving the Bi-Objective Integer Programming: A DEA methodology
URI https://ieeexplore.ieee.org/document/6996868
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LTwMhEJ60jQdPalrjOxw8Sttd2F3wVvuIJqb20JjeGhjA1OhuU1t_v7Bba0y8eCNkgAwE-GaYjwG4xoQbbZKYOh7FlDvm95xfaypVrFKjmclK3trzYzYei9lMTmpws-PCWGvL4DPbDsXyLd8UuAmusk7qwblIRR3qWZZWXK1vHkxXdvrF4GEagrV4eyv4K2NKeWGMDv431CG0fph3ZLK7U46gZvOmB9TFW7D7iQdr5G5Bn_RrdUyR4M97savQJERZvXuhW9Ijg2GPVKmhS6d5C6aj4bR_T7eJD-hCdtcUdWpsItJEC4MmsGeV08hQqsSjmUiiiZAlziMfb9xZFxtvHTOHVkiMdFdpdgyNvMjtCRBhjOLonOCoQkpe4fthmVRRFjiyHE-hGXSfL6uvLeZbtc_-rj6H_TC9FRXvAhrr1cZewh5-rhcfq6tyPb4AEE-Ouw
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LTwIxEJ4gmuhJDRjf9uDRwj7a3dYb8ghERA4bw430aTDKGgR_v-0uYky8eGuaaZtp0_ab6XwdgGtFiZaaRtiSMMLExm7PubXGXEQi0TLWacFbexqmoxGbTPi4AjcbLowxpgg-Mw1fLN7yda5W3lXWTBw4Zwnbgm1KSBSUbK1vJkzAm-28M8h8uBZprEV_5Uwproze_v8GO4D6D_cOjTe3yiFUzLzmIHX-6i1_5OAaupvhR_lSHlTIe_SezcI38XFWb07oFrVQp9tCZXLowm1eh6zXzdp9vE59gGc8WGIlE20oS6hkWmnPnxVWqlhxQR2eCbnSoYqpddjHmXfGRtrZx7FVhnEVykDI-Aiq83xujgExrQVR1jKihE_Ky1w_ccpFmHqWLFEnUPO6T9_Lzy2ma7VP_66-gt1-9jCcDgej-zPY81NdEvPOobpcrMwF7KjP5exjcVmszRes2JIC
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=proceeding&rft.title=2014+International+Conference+on+Control%2C+Decision+and+Information+Technologies+%28CoDIT%29&rft.atitle=Solving+the+Bi-Objective+Integer+Programming%3A+A+DEA+methodology&rft.au=Keshavarz%2C+Esmaiel&rft.au=Toloo%2C+Mehdi&rft.date=2014-11-01&rft.pub=IEEE&rft.spage=060&rft.epage=064&rft_id=info:doi/10.1109%2FCoDIT.2014.6996868&rft.externalDocID=6996868