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

Celý popis

Podrobná bibliografie

Vydáno v:	Optimization letters Ročník 15; číslo 7; s. 2351 - 2375
Hlavní autoři:	Ghazi, Abdelouafi, Roubi, Ahmed
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Berlin/Heidelberg Springer Berlin Heidelberg 01.10.2021
Témata:	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
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!