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

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Annals of operations research Jg. 296; H. 1-2; S. 735 - 753
Hauptverfasser:	Cherfaoui, Yasmine, Moulaï, Mustapha
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York Springer US 01.01.2021 Springer Springer Nature B.V
Schlagworte:	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
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!