Full-text resources of CEJSH and other databases are now available in the new Library of Science.
Visit https://bibliotekanauki.pl

Results found: 2

first rewind previous Page / 1 next fast forward last

Search results

Search:
in the keywords:  multiobjective linear programming
help Sort By:

help Limit search:
first rewind previous Page / 1 next fast forward last
1
Publication available in full text mode
Content available

An adaptive method to solve multilevel multiobjective linear programming problems

100%
KACI M., RADJEF S.
Operations Research and Decisions
|
2023
|
vol. 33
|
issue 3
29-44
EN
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.
2
Publication available in full text mode
Content available

An adaptive method to solve multilevel multiobjective linear programming problems

86%
Kaci M., Radjef S.
Operations Research and Decisions
|
2023
|
vol. 33
|
issue 3
EN
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.
first rewind previous Page / 1 next fast forward last
JavaScript is turned off in your web browser. Turn it on to take full advantage of this site, then refresh the page.