Title: Computing non-dominated solutions in MOLFP
Authors: Costa, João Paulo 
Keywords: Multiobjective linear fractional programming;Sum of linear ratios;Weight indifference regions
Issue Date: 2007
Citation: European Journal of Operational Research. 181:3 (2007) 1464-1475
Abstract: In this paper we present a technique to compute the maximum of a weighted sum of the objective functions in multiple objective linear fractional programming (MOLFP). The basic idea of the technique is to divide (by the approximate [`]middle') the non-dominated region in two sub-regions and to analyze each of them in order to discard one if it can be proved that the maximum of the weighted sum is in the other. The process is repeated with the remaining region. The process will end when the remaining regions are so little that the differences among their non-dominated solutions are lower than a pre-defined error. Through the discarded regions it is possible to extract conditions that establish weight indifference regions. These conditions define the variation range of the weights that necessarily leads to the same non-dominated solution. An example, illustrating the concept, is presented. Some computational results indicating the performance of the technique are also presented.
URI: http://hdl.handle.net/10316/5486
Rights: openAccess
Appears in Collections:FEUC- Artigos em Revistas Internacionais

Files in This Item:
File Description SizeFormat 
file42d111064f6d46d6830c232ab68b18db.pdf461.33 kBAdobe PDFView/Open
Show full item record
Google ScholarTM
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.