Multi-objective linear programming with interval coefficients

Purpose - The purpose of this paper is to extend a methodology for solving multi-objective linear programming (MOLP) problems, when the objective functions and constraints coefficients are stated as interval numbers.Design methodology approach - The approach proposed in this paper for the considered...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Kybernetes Ročník 42; číslo 3; s. 482 - 496
Hlavní autori: Hossein Razavi Hajiagha, Seyed, Amoozad Mahdiraji, Hannan, Sadat Hashemi, Shide
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: London Emerald Group Publishing Limited 22.03.2013
Predmet:
ISSN:0368-492X, 1758-7883
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Abstract Purpose - The purpose of this paper is to extend a methodology for solving multi-objective linear programming (MOLP) problems, when the objective functions and constraints coefficients are stated as interval numbers.Design methodology approach - The approach proposed in this paper for the considered problem is based on the maximization of the sum of membership degrees which are defined for each objective of multi objective problem. These membership degrees are constructed based on the deviation from optimal solutions of individual objectives. Then, the final model based on membership degrees is itself an interval linear programming which can be solved by current methods.Findings - The efficiency of the solutions obtained by the proposed method is proved. It is shown that the obtained solution by the proposed method for an interval multi objective problem is Pareto optimal.Research limitations implications - The proposed method can be used in modeling and analyzing of uncertain systems which are modeled in the context of multi objective problems and in which required information is ill defined.Originality value - The paper proposed a novel and well-defined algorithm to solve the considered problem.
AbstractList Purpose - The purpose of this paper is to extend a methodology for solving multi-objective linear programming (MOLP) problems, when the objective functions and constraints coefficients are stated as interval numbers. Design/methodology/approach - The approach proposed in this paper for the considered problem is based on the maximization of the sum of membership degrees which are defined for each objective of multi objective problem. These membership degrees are constructed based on the deviation from optimal solutions of individual objectives. Then, the final model based on membership degrees is itself an interval linear programming which can be solved by current methods. Findings - The efficiency of the solutions obtained by the proposed method is proved. It is shown that the obtained solution by the proposed method for an interval multi objective problem is Pareto optimal. Research limitations/implications - The proposed method can be used in modeling and analyzing of uncertain systems which are modeled in the context of multi objective problems and in which required information is ill defined. Originality/value - The paper proposed a novel and well-defined algorithm to solve the considered problem.
Author Hossein Razavi Hajiagha, Seyed
Amoozad Mahdiraji, Hannan
Sadat Hashemi, Shide
Author_xml – sequence: 1
  givenname: Seyed
  surname: Hossein Razavi Hajiagha
  fullname: Hossein Razavi Hajiagha, Seyed
  organization: Department of Systemic and Productivity Studies, Institute for Trade Studies and Research, Tehran, Iran
– sequence: 2
  givenname: Hannan
  surname: Amoozad Mahdiraji
  fullname: Amoozad Mahdiraji, Hannan
  organization: Department of Management, Kashan Branch, Islamic Azad University, Kashan, Iran
– sequence: 3
  givenname: Shide
  surname: Sadat Hashemi
  fullname: Sadat Hashemi, Shide
  organization: Department of Management, Kashan Branch, Islamic Azad University, Kashan, Iran
BookMark eNptkDFPwzAQhS1UJNLCD2CLxErgLk5iZ2BAFQWkIhaQ2CLXORdHiVOctIh_j6uyFd1ww313996bsonrHTF2iXCDCPIWeCGzMkWOyFMuQJywCEUuEyEln7BoP08C8HHGpsPQAGBapBCxu5dtO9qkXzWkR7ujuLWOlI83vl971XXWreNvO37G1o3kd6qNdU_GWG3JjcM5OzWqHejir8_Y--Lhbf6ULF8fn-f3y4QwK0WSAxfa1ERAmUGThZI1Cl6SznOxkikhAJWqoJVUZJQWhKipIF0bVQRTM3Z1uBtkfW1pGKum33oXXlbI8yyHYLkI1PWBoo68autq422n_E91FE61qU3A4X8codpnerzGfwFIoGm4
CODEN KBNTA3
ContentType Journal Article
Copyright Emerald Group Publishing Limited
Copyright Emerald Group Publishing Limited 2013
Copyright_xml – notice: Emerald Group Publishing Limited
– notice: Copyright Emerald Group Publishing Limited 2013
DBID 7SC
7SP
7TB
7XB
8AO
8FD
8FE
8FG
AFKRA
ARAPS
AZQEC
BENPR
BGLVJ
CCPQU
DWQXO
FR3
GNUQQ
GUQSH
HCIFZ
JQ2
K7-
L7M
L~C
L~D
M0N
M2O
MBDVC
P5Z
P62
PHGZM
PHGZT
PKEHL
PQEST
PQGLB
PQQKQ
PQUKI
Q9U
DOI 10.1108/03684921311323707
DatabaseName Computer and Information Systems Abstracts
Electronics & Communications Abstracts
Mechanical & Transportation Engineering Abstracts
ProQuest Central (purchase pre-March 2016)
ProQuest Pharma Collection
Technology Research Database
ProQuest SciTech Collection
ProQuest Technology Collection
ProQuest Central UK/Ireland
Advanced Technologies & Computer Science Collection
ProQuest Central Essentials - QC
ProQuest Central
ProQuest Technology Collection
ProQuest One
ProQuest Central
Engineering Research Database
ProQuest Central Student
ProQuest Research Library
SciTech Collection (ProQuest)
ProQuest Computer Science Collection
Computer Science Database
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts – Academic
Computer and Information Systems Abstracts Professional
Computing Database
Research Library (ProQuest)
Research Library (Corporate)
Advanced Technologies & Aerospace Database
ProQuest Advanced Technologies & Aerospace Collection
ProQuest Central Premium
ProQuest One Academic (New)
ProQuest One Academic Middle East (New)
ProQuest One Academic Eastern Edition (DO NOT USE)
ProQuest One Applied & Life Sciences
ProQuest One Academic (retired)
ProQuest One Academic UKI Edition
ProQuest Central Basic
DatabaseTitle Research Library Prep
Computer Science Database
ProQuest Central Student
Technology Collection
Technology Research Database
Computer and Information Systems Abstracts – Academic
ProQuest One Academic Middle East (New)
Mechanical & Transportation Engineering Abstracts
ProQuest Advanced Technologies & Aerospace Collection
ProQuest Central Essentials
ProQuest Computer Science Collection
Computer and Information Systems Abstracts
SciTech Premium Collection
ProQuest One Community College
ProQuest Pharma Collection
ProQuest Central
ProQuest One Applied & Life Sciences
ProQuest Central Korea
ProQuest Research Library
ProQuest Central (New)
Advanced Technologies Database with Aerospace
Advanced Technologies & Aerospace Collection
ProQuest Computing
ProQuest Central Basic
ProQuest One Academic Eastern Edition
Electronics & Communications Abstracts
ProQuest Technology Collection
ProQuest SciTech Collection
Computer and Information Systems Abstracts Professional
Advanced Technologies & Aerospace Database
ProQuest One Academic UKI Edition
Engineering Research Database
ProQuest One Academic
ProQuest One Academic (New)
DatabaseTitleList Research Library Prep

Database_xml – sequence: 1
  dbid: BENPR
  name: ProQuest Central
  url: https://www.proquest.com/central
  sourceTypes: Aggregation Database
DeliveryMethod fulltext_linktorsrc
Discipline Sciences (General)
EISSN 1758-7883
EndPage 496
ExternalDocumentID 2977952271
10.1108/03684921311323707
Genre Feature
GroupedDBID 0R
1WG
29L
3FY
3V.
4.4
5GY
5VS
70U
8AO
8FE
8FG
8FW
8R4
8R5
9E0
AADTA
AADXL
AAGBP
AAMCF
AAPBV
AAPSD
AATHL
AAUDR
ABEAN
ABIJV
ABKQV
ABPTK
ABSDC
ACGFS
ACIWK
ACMTK
ADOMW
AEBVX
AEBZA
AEDOK
AEMMR
AENEX
AEUCW
AFKRA
AFNZV
AFYHH
AFZLO
AJEBP
ALMA_UNASSIGNED_HOLDINGS
ARAPS
ASMFL
ATGMP
AUCOK
AVELQ
AZQEC
BENPR
BGLVJ
BPHCQ
BPQFQ
BUONS
CS3
DC
DWQXO
EBS
ECCUG
EJD
FNNZZ
GEI
GEL
GMN
GNUQQ
GQ.
GUQSH
H13
HCIFZ
HZ
IJT
IPNFZ
J1Y
JI-
JL0
K6V
K7-
KBGRL
M0N
M2O
O9-
P62
PADUT
PQEST
PQQKQ
PQUKI
PRG
PRINS
PROAC
Q2X
Q3A
RIG
ROL
TDQ
TEM
TGG
TMD
TMF
V1G
Z11
Z12
.DC
7SC
7SP
7TB
7XB
8FD
ABJNI
ABXQL
ABYQI
ACZLT
AEACZ
AFNTC
AHMHQ
AODMV
CCPQU
FR3
HZ~
JQ2
L7M
L~C
L~D
M42
MBDVC
PHGZM
PHGZT
PKEHL
PQGLB
Q9U
SBBZN
SDURG
ID FETCH-LOGICAL-e1497-5037cfdee0e4f1f4f4f8d1739ec557b82e100e9a6eb8aefac7e11ce6ecdfa6213
IEDL.DBID P5Z
ISSN 0368-492X
IngestDate Fri Jul 25 04:06:21 EDT 2025
Tue Aug 23 17:29:43 EDT 2022
Wed Jul 31 14:17:28 EDT 2019
IsDoiOpenAccess false
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Issue 3
Keywords Fuzzy logic
Pareto optimallity
Multi objective linear programming
Decision making
Linear programming
Order relations
Modelling
Interval numbers
Membership degree
Programming and algorithm theory
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-e1497-5037cfdee0e4f1f4f4f8d1739ec557b82e100e9a6eb8aefac7e11ce6ecdfa6213
Notes SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
OpenAccessLink https://dora.dmu.ac.uk/handle/2086/20457
PQID 1354502376
PQPubID 37993
PageCount 15
ParticipantIDs emerald_primary_10_1108_03684921311323707
proquest_journals_1354502376
PublicationCentury 2000
PublicationDate 20130322
PublicationDateYYYYMMDD 2013-03-22
PublicationDate_xml – month: 03
  year: 2013
  text: 20130322
  day: 22
PublicationDecade 2010
PublicationPlace London
PublicationPlace_xml – name: London
PublicationTitle Kybernetes
PublicationYear 2013
Publisher Emerald Group Publishing Limited
Publisher_xml – name: Emerald Group Publishing Limited
SSID ssj0012620
Score 1.8971294
Snippet Purpose - The purpose of this paper is to extend a methodology for solving multi-objective linear programming (MOLP) problems, when the objective functions and...
SourceID proquest
emerald
SourceType Aggregation Database
Enrichment Source
Publisher
StartPage 482
SubjectTerms Algorithms
Decision making
Linear programming
Operations research
Studies
Title Multi-objective linear programming with interval coefficients
URI https://www.emerald.com/insight/content/doi/10.1108/03684921311323707/full/html
https://www.proquest.com/docview/1354502376
Volume 42
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVPQU
  databaseName: Advanced Technologies & Aerospace Database
  customDbUrl:
  eissn: 1758-7883
  dateEnd: 20241209
  omitProxy: false
  ssIdentifier: ssj0012620
  issn: 0368-492X
  databaseCode: P5Z
  dateStart: 20010315
  isFulltext: true
  titleUrlDefault: https://search.proquest.com/hightechjournals
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: Computer Science Database
  customDbUrl:
  eissn: 1758-7883
  dateEnd: 20241209
  omitProxy: false
  ssIdentifier: ssj0012620
  issn: 0368-492X
  databaseCode: K7-
  dateStart: 20010315
  isFulltext: true
  titleUrlDefault: http://search.proquest.com/compscijour
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: ProQuest Central
  customDbUrl:
  eissn: 1758-7883
  dateEnd: 20241209
  omitProxy: false
  ssIdentifier: ssj0012620
  issn: 0368-492X
  databaseCode: BENPR
  dateStart: 20010315
  isFulltext: true
  titleUrlDefault: https://www.proquest.com/central
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: Research Library
  customDbUrl:
  eissn: 1758-7883
  dateEnd: 20241209
  omitProxy: false
  ssIdentifier: ssj0012620
  issn: 0368-492X
  databaseCode: M2O
  dateStart: 20010315
  isFulltext: true
  titleUrlDefault: https://search.proquest.com/pqrl
  providerName: ProQuest
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV3dS8MwED9088EXdX7gdI4-KLiHYL-2tA8iKhuCOoeoDF9Kml5ggutcp3-_lzRzMMEXKbSQhlCul7vLff0AjmUqFZJ0ZKTLMxYGPGOkhjyGLiopiIFcU8X_csf7_Wg4jAfW4VbYtMq5TDSCOsul9pGfeQHpelfncFxMPphGjdLRVQuhsQpV3SVBQzcM2q8_UQTdbL2MVUYsjP2hjWoa5BsaoyHdbCagRTWa7FJF7kIqG1XT2_zvR27BhjUyncuSK2qwguNtqNltXDinttd0awfOTQEuy9O3UvA52uoUU8embb2TYnO0q9YZmdxIWlTmaLpO6ASMXXjudZ-ub5hFVGBIJyHO2m7ApcqQ_kSoPBXSFWUeD2KU7TZPIx8918VYdDCNBCohOXqexA7KTIkOUWsPKuN8jPvgCDI0_DhMVYfW8lOVxgE9QylEGsVcBXU4sfRMJmXfjOQXzZNJpurQWp5nziUaHHN5fh0ac7IndqsVyYLmB3-_PoR132BZBMz3G1CZTT_xCNbk12xUTJtQver2B49NWL3ljO73_kPTcNM3BSjMbw
linkProvider ProQuest
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1LS8NAEB60CnrxLdZnDhb0sJjspt3kICI-UFqLhyq9xc1mFirY1rYq_il_o7ObVKGCNw-SQ2CzDNnMZGZn5_EB7OtUGyTtyMiWZywUMmNkhgKGPhqtSIB8V8V_35DNZtRux7dT8DGuhbFplWOd6BR11tP2jPwoEGTrfZvDcdJ_ZhY1ykZXxxAauVjU8f2NXLbh8fU58bfC-eVF6-yKFagCDMkbkKzqC6lNhvQ2oQlMSFeUBVLEqKtVmUYcA9_HWNUwjRQapSUGgcYa6syoGg8E0Z2GmVBE0v5Xdcm-oha2uXseG41YGPN2EUV1SDs0RkO2uY2gRVj02okK4G8r4Ezb5eJ_-yhLsFBsor3TXOqXYQq7K7BcqKmhd1D00j5chWNXYMx66WOu2D27q1YDr0hLeyLD7dmjaK_jcj-JqO6h66phE0zW4O5PlrEOpW6vixvgKdpI8ThMTY1o8dSksaB7qJVKo1gaUYZKwb-kn_cFSX7wOOlnpgyHk_Oc32XBPyfnl2F7zOakUCXD5JvHm78_3oO5q9ZNI2lcN-tbMM8dbodgnG9DaTR4wR2Y1a-jznCw66TWg4e_lohP5H4pSQ
linkToPdf http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1LS8QwEB58IV58i-uzBwU9BNuku2kPIqIuirLsQWXxUtN0Aiu4u-76wL_mr3OSZhVW8OZBeiikYWg605lM5psZgB2da4OkHRnZ8oLFQhaMzFDEMESjFQlQ6LL4b69ko5G0WmlzDD6GuTAWVjnUiU5RF11tz8gPIkG2PrQYjgPjYRHN0_pR74nZDlI20jpsp1GKyCW-v5H7Nji8OCVe73JeP7s-OWe-wwBD8gwkq4ZCalMgvVlsIhPTlRSRFCnqalXmCccoDDFVNcwThUZpiVGksYa6MKrGI0F0x2FSko9p4YTN6t1XBMMWei_jpAmLU97yEVXXdYfGaMgWuhG0INvJdiQb-NsiODNXn_vPH2geZv3mOjgu_4YFGMPOIix49TUI9nyN7f0lOHSJx6ybP5QKP7C7bdUPPFztkQx6YI-og7bDhBJR3UVXbcMCT5bh5k-WsQITnW4HVyFQtMHiaZybGtHiuclTQfdYK5UnqTSiAruel1mvrBeS_eB31itMBfZH5zl_zDYFHZ1fgY0hyzOvYgbZN7_Xfn-8DdMkCNnVReNyHWa4a-chGOcbMPHcf8FNmNKvz-1Bf8sJcAD3fy0Qn2F1Mm0
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%3Ajournal&rft.genre=article&rft.atitle=Multi-objective+linear+programming+with+interval+coefficients&rft.jtitle=Kybernetes&rft.au=Seyed+Hossein+Razavi+Hajiagha&rft.au=Hannan+Amoozad+Mahdiraji&rft.au=Shide+Sadat+Hashemi&rft.date=2013-03-22&rft.pub=Emerald+Group+Publishing+Limited&rft.issn=0368-492X&rft.eissn=1758-7883&rft.volume=42&rft.issue=3&rft.spage=482&rft_id=info:doi/10.1108%2F03684921311323707&rft.externalDBID=HAS_PDF_LINK&rft.externalDocID=2977952271
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0368-492X&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0368-492X&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0368-492X&client=summon