Optimality conditions and DC-Dinkelbach-type algorithm for generalized fractional programs with ratios of difference of convex functions

In this paper, we develop optimality conditions and propose an algorithm for generalized fractional programming problems whose objective function is the maximum of finite ratios of difference of convex (dc) functions, with dc constraints, that we will call later, DC-GFP. Such problems are generally...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Optimization letters Jg. 15; H. 7; S. 2351 - 2375
Hauptverfasser:	Ghazi, Abdelouafi, Roubi, Ahmed
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Berlin/Heidelberg Springer Berlin Heidelberg 01.10.2021
Schlagworte:	Computational Intelligence Mathematics Mathematics and Statistics Numerical and Computational Physics Operations Research/Decision Theory Optimization Original Paper Simulation DC programming Optimality conditions Fractional programming Convex programming Dinkelbach algorithms
ISSN:	1862-4472, 1862-4480
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!