An interactive method for multiple objective linear fractional programming problems

Detalhes bibliográficos
Autor(a) principal: Costa, João Paulo
Data de Publicação: 2005
Tipo de documento: Artigo
Idioma: eng
Título da fonte: Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
Texto Completo: http://hdl.handle.net/10316/7628
https://doi.org/10.1007/s00291-004-0191-5
Resumo: 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.
id RCAP_d5e3e2366b5daa29fe415277a1922a15
oai_identifier_str oai:estudogeral.uc.pt:10316/7628
network_acronym_str RCAP
network_name_str Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
repository_id_str 7160
spelling An interactive method for multiple objective linear fractional programming problemsMultiple 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.2005info:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/articlehttp://hdl.handle.net/10316/7628http://hdl.handle.net/10316/7628https://doi.org/10.1007/s00291-004-0191-5engOR Spectrum. 27:4 (2005) 633-652Costa, João Pauloinfo:eu-repo/semantics/openAccessreponame:Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)instname:Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informaçãoinstacron:RCAAP2020-05-25T12:05:54Zoai:estudogeral.uc.pt:10316/7628Portal AgregadorONGhttps://www.rcaap.pt/oai/openaireopendoar:71602024-03-19T20:57:54.419966Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) - Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informaçãofalse
dc.title.none.fl_str_mv An interactive method for multiple objective linear fractional programming problems
title An interactive method for multiple objective linear fractional programming problems
spellingShingle An interactive method for multiple objective linear fractional programming problems
Costa, João Paulo
title_short An interactive method for multiple objective linear fractional programming problems
title_full An interactive method for multiple objective linear fractional programming problems
title_fullStr An interactive method for multiple objective linear fractional programming problems
title_full_unstemmed An interactive method for multiple objective linear fractional programming problems
title_sort An interactive method for multiple objective linear fractional programming problems
author Costa, João Paulo
author_facet Costa, João Paulo
author_role author
dc.contributor.author.fl_str_mv Costa, João Paulo
description 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.
publishDate 2005
dc.date.none.fl_str_mv 2005
dc.type.status.fl_str_mv info:eu-repo/semantics/publishedVersion
dc.type.driver.fl_str_mv info:eu-repo/semantics/article
format article
status_str publishedVersion
dc.identifier.uri.fl_str_mv http://hdl.handle.net/10316/7628
http://hdl.handle.net/10316/7628
https://doi.org/10.1007/s00291-004-0191-5
url http://hdl.handle.net/10316/7628
https://doi.org/10.1007/s00291-004-0191-5
dc.language.iso.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv OR Spectrum. 27:4 (2005) 633-652
dc.rights.driver.fl_str_mv info:eu-repo/semantics/openAccess
eu_rights_str_mv openAccess
dc.source.none.fl_str_mv reponame:Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
instname:Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação
instacron:RCAAP
instname_str Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação
instacron_str RCAAP
institution RCAAP
reponame_str Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
collection Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
repository.name.fl_str_mv Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) - Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação
repository.mail.fl_str_mv
_version_ 1799133869298941952