Optimization over an integer efficient set of a Multiple Objective Linear Fractional Problem

Ouiza Zerdani and Mustapha Moulai (mmoulai@usthb.dz)

MPRA Paper from University Library of Munich, Germany

Abstract: The problem of optimizing a real valued function over an efficient set of the Multiple Objective Linear Fractional Programming problem (MOLFP) is an important field of research and has not received as much attention as did the problem of optimizing a linear function over an efficient set of the Multiple Objective Linear Programming problem (MOLP).In this work an algorithm is developed that optimizes an arbitrary linear function over an integer efficient set of problem (MOLFP) without explicitly having to enumerate all the efficient solutions. The proposed method is based on a simple selection technique that improves the linear objective value at each iteration.A numerical illustration is included to explain the proposed method.

Keywords: Integer programming; Optimization over the efficient set; Multiple objective linear fractional programming; Global optimization (search for similar items in EconPapers)
JEL-codes: C61 I23 (search for similar items in EconPapers)
Date: 2011-02-10
New Economics Papers: this item is included in nep-cmp
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Published in Applied Mathematical Sciences no. 50.Vol. 5(2011): pp. 2451-2466

Downloads: (external link)
https://mpra.ub.uni-muenchen.de/35579/1/MPRA_paper_35579.pdf original version (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:pra:mprapa:35579

Access Statistics for this paper

More papers in MPRA Paper from University Library of Munich, Germany Ludwigstraße 33, D-80539 Munich, Germany. Contact information at EDIRC.
Bibliographic data for series maintained by Joachim Winter (winter@lmu.de).