Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content

An interactive method for multiple objective linear fractional programming problems

  • Published:
OR Spectrum Aims and scope Submit manuscript

Abstract.

Multiple objective linear fractional programming (MOLFP) is an important field of research. Using some branch and bound techniques, we have developed a new interactive method for MOLFP that drastically reduces the computational effort needed, while providing guidance for the decision maker in the choice of his/her preferred solutions. The basic idea of the computation phase of the algorithm is to optimize one of the fractional objective functions while constraining the others. Several linear programming problems, organized in a tree structure, are generated as the search evolves. The whole idea is simple and it results in a fast and very intuitive approach to exploring the non-dominated set of solutions in MOLFP, and eventually to finding the preferred solution.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Rent this article via DeepDyve

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to João Paulo Costa.

Additional information

This work was supported by the Fundação para a Ciência e Tecnologia and FEDER, project POCTI/32405/GES/2000.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Costa, J.P. An interactive method for multiple objective linear fractional programming problems. OR Spectrum 27, 633–652 (2005). https://doi.org/10.1007/s00291-004-0191-5

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00291-004-0191-5

Keywords: