Izvorni znanstveni članak

https://doi.org/10.17535/crorr.2022.0002

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

Mustapha Kaci orcid.org/0000-0002-1965-5889 ; Faculty of Mathematics and Computer Science, Signal Image Parole (SIMPA) Laboratory, University of Sciences and Technology of Oran Mohamed Boudiaf USTO-MB
Sonia Radjef ; Faculty of Mathematics and Computer Science, Signal Image Parole (SIMPA) Laboratory, University of Sciences and Technology of Oran Mohamed Boudiaf USTO-MB

Sažetak

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.

Ključne riječi

Multi-level multi-objective linear programming; decision-makers; non-dominated points; non-dominated facets; non-dominated extreme points

Hrčak ID:

280249

URI

https://hrcak.srce.hr/280249

Datum izdavanja:

12.7.2022.

Posjeta: 1.134 *