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

Authors

  • Mustapha Kaci University of Sciences and Technology of Oran Mohamed Boudiaf USTO-MB, El Mnaouar, BP 1505, Bir El Djir 31000, Oran, Algeria.
  • Sonia Radjef University of Sciences and Technology of Oran Mohamed Boudiaf USTO-MB, El Mnaouar, BP 1505, Bir El Djir 31000, Oran, Algeria

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.

Downloads

Published

2022-07-12

Issue

Vol. 13 No. 1 (2022): CRORR

Section

CRORR Journal Regular Issue

License

- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal

- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.

- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).