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 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.http://dx.doi.org/10.1007/s00291-004-0191-