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

被引:2
|
作者
Kaci, Mustapha [1 ]
Radjef, Sonia [1 ]
机构
[1] Univ Sci & Technol Oran Mohamed Boudiaf USTO MB, Fac Math & Comp Sci, Signal Image Parole SIMPA Lab, BP 1505, Bir El Djir 31000, Oran, Algeria
关键词
Multi-level multi-objective linear programming; decision-makers; non-dominated points; non-dominated facets; non-dominated extreme points; MATHEMATICAL PROGRAMS;
D O I
10.17535/crorr.2022.0002
中图分类号
F [经济];
学科分类号
02 ;
摘要
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.
引用
收藏
页码:13 / 30
页数:18
相关论文
共 50 条