• Computing non-dominated soluti...

Treffer: Computing non-dominated solutions in MOLFP

Title:
Computing non-dominated solutions in MOLFP
Authors:
COSTA, Joao Paulo
Source:
European journal of operational research. 181(3):1464-1475
Publisher Information:
Amsterdam: Elsevier, 2007.
Publication Year:
2007
Physical Description:
print, 1/4 p
Original Material:
INIST-CNRS
Subject Terms:
Control theory, operational research, Automatique, recherche opérationnelle, Sciences exactes et technologie, Exact sciences and technology, Sciences appliquees, Applied sciences, Recherche operationnelle. Gestion, Operational research. Management science, Fonction objectif, Objective function, Función objetivo, Fonction rationnelle, Rational function, Función racional, Programmation fractionnaire, Fractional programming, Programación fraccionaria, Programmation linéaire, Linear programming, Programación lineal, Programmation multiobjectif, Multiobjective programming, Programación multiobjetivo, Multiobjective linear fractional programming, Sum of linear ratios, Weight indifference regions
Document Type:
Konferenz Conference Paper
File Description:
text
Language:
English
Author Affiliations:
Faculdade de Economia da Universidade de Coimbra and INESC Coimbra, Av. Dias da Silva 165, 3004-512 Coimbra, Portugal
ISSN:
0377-2217
Access URL:
http://pascal-francis.inist.fr/vibad/index.php?action=search&terms=18674452
Rights:
Copyright 2007 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Operational research. Management
Accession Number:
edscal.18674452
Database:
PASCAL Archive

Weitere Informationen

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 predefined 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.