An interactive method for multiple objective linear fractional programming problems

摘要: 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 decision maker in choice his/her preferred solutions. The basic idea computation phase algorithm to optimize one functions constraining others. Several problems, organized tree structure, are generated as search evolves. whole simple it results fast very intuitive approach exploring non-dominated set solutions MOLFP, eventually finding solution.