Journal
ANNALS OF OPERATIONS RESEARCH
Volume 296, Issue 1-2, Pages 735-753Publisher
SPRINGER
DOI: 10.1007/s10479-020-03581-0
Keywords
Multiobjective programming; Fractional programming; Integer programming; Branch-and-Cut
Categories
Funding
- Direction Generale de la Recherche Scientifique et du Developpement Technologique (DGRSDT) [C0656104]
Ask authors/readers for more resources
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.
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.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available