An adaptive method to solve multilevel multiobjective linear programming problems

Mustapha Kaci () and Sonia Radjef ()

Operations Research and Decisions, 2023, vol. 33, issue 3, 29-44

Abstract: This paper is a follow-up to a previous work where we defined and generated the set of all possible compromises of multilevel multiobjective linear programming problems (ML-MOLPP). 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 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 settlements achieved. This method will allow us to transform the initial multilevel problem into an ML-MOLPP with bonded variables. Then, apply the adaptive method which is the most efficient to solve all the multiobjective linear programming problems involved in the resolution process instead of the simplex method. Finally, all the construction stages are carefully checked and illustrated with a numerical example.

Keywords: multilevel programming; multiobjective linear programming; adaptive method; sub-optimality estimate; non-dominated solutions; non-dominated facets (search for similar items in EconPapers)
Date: 2023
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
https://ord.pwr.edu.pl/assets/papers_archive/ord2023vol33no3_2.pdf (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wut:journl:v:33:y:2023:i:3:p:29-44:id:2

DOI: 10.37190/ord230302

Access Statistics for this article

More articles in Operations Research and Decisions from Wroclaw University of Science and Technology, Faculty of Management Contact information at EDIRC.
Bibliographic data for series maintained by Adam Kasperski ().