Generating efficient faces for multiobjective linear programming problems
by Hela Masri; Saoussen Krichen; Adel Guitouni
International Journal of Operational Research (IJOR), Vol. 15, No. 1, 2012

Abstract: In this paper, we propose a new method for generating the efficient solutions in multiobjective linear programming (MOLP) problems. An exact tree-based method is proposed to generate all the pareto set by adopting a bottom-up approach. This method is suitable for small- and medium-sized problems. For large-scaled problems, we develop a tabu search-based heuristic combined with a dichotomic exploration of the efficient set. This method generates potentially maximal efficient faces. The two methods are empirically compared. Experimental results show that the tree-based method ensures finding the entire efficient set in a reasonable central processing unit (CPU) time. Furthermore, the dichotomic TS method has a significant advantage for solving large-scaled instances of MOLP problems. It features good compromise between the central processing unit (CPU) time and the size of the generated efficient set.

Online publication date: Sun, 11-Jan-2015

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Operational Research (IJOR):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com