In this paper, we present a new adaptive algorithm for defining the solution set of a multiobjective linear programming problem, where the decision variables are upper and lower bounded, using the direct support method. The principle particularitie of this method is the fact that it handles the bounds of variables such are they are initially presented, and possesses a suboptimal criterion which stops the algorithm with the desired accuracy.
Article
View A new adaptive algorithm for linear multiobjective programming problems