-

 

 

 




Optimization Online





 

A new adaptive algorithm for linear multiobjective programming problems

Sonia Radjef(sonia_radjef***at***yahoo.fr)
M.O Bibi(mobibi***at***hotmail.com)
M.S Radjef(radjefms***at***yahoo.fr)

Abstract: 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.

Keywords: linear multiobjective problem, bounded variables, mixed variables, direct support method, efficient point, weakly efficient point, suboptimality

Category 1: Other Topics (Multi-Criteria Optimization )

Category 2: Linear, Cone and Semidefinite Programming

Citation:

Download: [PDF]

Entry Submitted: 11/19/2006
Entry Accepted: 11/22/2006
Entry Last Modified: 11/19/2006

Modify/Update this entry


  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository

 

Submit
Update
Policies
Coordinator's Board
Classification Scheme
Credits
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Programming Society