An adaptive method to solve multilevel multiobjective linear programming problems

This paper is a follow-up to a previous work where we defined and generated the set of all the possible compromises of multilevel multiobjective linear programming problems (ML-MOLPP). In this paper, we introduce a new algorithm to solve ML-MOLPP in which the adaptive method of linear programming is...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	arXiv.org
Hlavní autori:	Mustapha Kaci, Radjef, Sonia
Médium:	Paper
Jazyk:	English
Vydavateľské údaje:	Ithaca Cornell University Library, arXiv.org 27.10.2022
Predmet:	Algorithms Linear programming
ISSN:	2331-8422
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Popis
Shrnutí:	This paper is a follow-up to a previous work where we defined and generated the set of all the possible compromises of multilevel multiobjective linear programming problems (ML-MOLPP). In this paper, we introduce a new algorithm to solve ML-MOLPP in which the adaptive method of linear programming is nested. First, we start by generating the set of all the possible compromises (set of all non-dominated solutions). After that, an algorithm based on the adaptive method of linear programming is developed to select the best compromise among all the possible compromises achieved. Finally, all the construction stages are carefully checked and illustrated with a numerical example.
Bibliografia:	SourceType-Working Papers-1 ObjectType-Working Paper/Pre-Print-1 content type line 50
ISSN:	2331-8422
DOI:	10.48550/arxiv.2210.14302