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...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Annals of operations research Ročník 296; číslo 1-2; s. 735 - 753
Hlavní autori: Cherfaoui, Yasmine, Moulaï, Mustapha
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: New York Springer US 01.01.2021
Springer
Springer Nature B.V
Predmet:
Branch and bound algorithms
Business and Management
Combinatorics
Convexity
Cutting
Integer programming
Integers
Linear programming
Management research
Mathematical programming
Mathematics
Operations research
Operations Research/Decision Theory
S.i.: Mopgp 2017
Theory of Computation
Algeria
Integer programming
90C32
90C10
Secondary: 90C57
Primary: 90C29
Multiobjective programming
Fractional programming
Branch-and-Cut
ISSN:0254-5330, 1572-9338
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí: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.
Bibliografia:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0254-5330
1572-9338
DOI:10.1007/s10479-020-03581-0