Generating the efficient set of MultiObjective Integer Linear plus Linear Fractional Programming Problems

The problem of optimizing a linear plus linear fractional function is an important field of search, it is a difficult problem since the linear plus linear fractional function doesn't possess any convexity propriety. In this paper, we propose a method that generates the set of the efficient solutions of multiobjective integer linear plus linear fractional programming problem. Our method consists in Branch-and-Bound exploration combined with cutting plane technique that allows to remove from search inefficient solutions. The cutting plane technique takes into account the inefficiency of a solution in another problem that implies the inefficiency of that solution in our problem and uses this link to reduce the exploration's domain.

Automated summary

This paper introduces a method for generating the set of efficient solutions for multiobjective integer linear plus linear fractional programming problems, which involves Branch-and-Bound exploration and cutting plane technique to eliminate inefficient solutions. The cutting plane technique reduces exploration's domain by considering the inefficiency of a solution in another problem.