The set of all the possible compromises of a multi-level multi-objective linear programming problem

IF 0.5 Q4 ECONOMICS
Mustapha Kaci, Sonia Radjef
{"title":"The set of all the possible compromises of a multi-level multi-objective linear programming problem","authors":"Mustapha Kaci, Sonia Radjef","doi":"10.17535/crorr.2022.0002","DOIUrl":null,"url":null,"abstract":"In this paper, a new approach is developed to solve multi-level multi-objective linear programming problems (ML-MOLPP), by providing the set of all the compromises without taking into account the hierarchy of the problem. A simple criterion is developed for testing whether a given feasible solution is a possible compromise or not. We describe a method used to generate the set of all the compromises, based on the P.L. Yu and M. Zeleny’s method. Theoretical results, numerical example and flow diagram are reported.","PeriodicalId":44065,"journal":{"name":"Croatian Operational Research Review","volume":" ","pages":""},"PeriodicalIF":0.5000,"publicationDate":"2022-07-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Croatian Operational Research Review","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.17535/crorr.2022.0002","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"ECONOMICS","Score":null,"Total":0}
引用次数: 4

Abstract

In this paper, a new approach is developed to solve multi-level multi-objective linear programming problems (ML-MOLPP), by providing the set of all the compromises without taking into account the hierarchy of the problem. A simple criterion is developed for testing whether a given feasible solution is a possible compromise or not. We describe a method used to generate the set of all the compromises, based on the P.L. Yu and M. Zeleny’s method. Theoretical results, numerical example and flow diagram are reported.
多级多目标线性规划问题的所有可能折衷的集合
本文提出了一种求解多目标线性规划问题(ML-MOLPP)的新方法,该方法在不考虑问题层次的情况下给出了所有妥协的集合。开发了一个简单的标准,用于测试给定的可行解决方案是否是可能的折衷方案。基于P.L. Yu和M. Zeleny的方法,我们描述了一种用于生成所有妥协集合的方法。给出了理论结果、数值算例和流程图。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
CiteScore
1.40
自引率
0.00%
发文量
5
审稿时长
22 weeks
期刊介绍: Croatian Operational Research Review (CRORR) is the journal which publishes original scientific papers from the area of operational research. The purpose is to publish papers from various aspects of operational research (OR) with the aim of presenting scientific ideas that will contribute both to theoretical development and practical application of OR. The scope of the journal covers the following subject areas: linear and non-linear programming, integer programing, combinatorial and discrete optimization, multi-objective programming, stohastic models and optimization, scheduling, macroeconomics, economic theory, game theory, statistics and econometrics, marketing and data analysis, information and decision support systems, banking, finance, insurance, environment, energy, health, neural networks and fuzzy systems, control theory, simulation, practical OR and applications. The audience includes both researchers and practitioners from the area of operations research, applied mathematics, statistics, econometrics, intelligent methods, simulation, and other areas included in the above list of topics. The journal has an international board of editors, consisting of more than 30 editors – university professors from Croatia, Slovenia, USA, Italy, Germany, Austria and other coutries.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信