In this thesis, we present several implementable methods for solving generalized fractional programming problems. We develop the traditional Dinkelbach-type methods as well as the Dinkelbach-type methods in which a prox-regularization term is added in order to prevent the numerical difficulties from arising. Subsequently, in the framework of convex fractional programming, we develop a method that can be seen as the "dual" algorithm to the Dinkelbach-type one.
Méthodes primales et duales de type Dinkelbach en programmation fractionnelle généralisée
Simons, E. (Author). 2006
Student thesis: Master types › Master in Mathematics