Algorithms for generalized fractional programming

A generalized fractional programming problem is specified as a nonlinear program where a nonlinear function defined as the maximum over several ratios of functions is to be minimized on a feasible domain of ⁿ . The purpose of this paper is to outline basic approaches and basic types of algorithms available to deal with this problem and to review their convergence analysis. The conclusion includes results and comments on the numerical efficiency of these algorithms.This research was supported by NSERC (grant A8312) and Cooperation franco-québécoise (projet 20-02-13). Paper presented at Workshop on Mathematical Programming Catholic University of Rio de Janeiro, Brazil, October 10–14, 1988.