Wednesday, 15:15 - 15:40 h, Room: H 1029


Sonia Radjef
The direct support method to solve a linear multiobjective problem with bounded variables

Coauthor: Mohand Ouamer Bibi


We propose a new efficient method for defining the solution set of a multiobjective problem, where the objective functions involved are linear, the set of feasible points is a set of linear constraints and the decision variables are
are upper and lower bounded. The algorithm is a generalization of the direct support method, for solution a linear mono-objective program. Its particularity is that it avoids the
preliminary transformation of the decision variables. It handles the bounds such as they are initially formulated. The method is really effective, simple to use and permits to speed-up the resolution process. We use the suboptimal criterion of the method in single-objective programming to find the subefficient extreme points and the subweakly efficient extreme
points of the problem. This algorithm is applied to solve a problem of production planning in the Ifri Dairy.


Talk 1 of the invited session Wed.3.H 1029
"Applications of vector and set optimization" [...]
Cluster 15
"Multi-objective optimization" [...]


  Do you need Missouri Payday Loans as soon as possible? In this section we give only a brief summary recommendation for admission of Levitra. Full information can be found in the instructions for receiving medications with vardenafil.