![Computing non-dominated solutions in MOLFP [An article from: European Journal of Operational Research]](https://www.ebooknetworking.net/books/B00/0PD/bigB000PDYSPK.jpg)
Computing non-dominated solutions in MOLFP [An article from: European Journal of Operational Research]
Book Details
Author(s)J.P. Costa
PublisherElsevier
ISBN / ASINB000PDYSPK
ISBN-13978B000PDYSP2
MarketplaceIndia 🇮🇳
Description
This digital document is a journal article from European Journal of Operational Research, published by Elsevier in 2007. The article is delivered in HTML format and is available in your Amazon.com Media Library immediately after purchase. You can view it with any web browser.
Description:
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.
Description:
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.
