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

Full description

Bibliographic Details

Published in:	Optimization letters Vol. 15; no. 7; pp. 2351 - 2375
Main Authors:	Ghazi, Abdelouafi, Roubi, Ahmed
Format:	Journal Article
Language:	English
Published:	Berlin/Heidelberg Springer Berlin Heidelberg 01.10.2021
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!