Algorithm for generalized fractional programming

Algorithm for generalized fractional programming

0.00 Avg rating0 Votes
Article ID: iaor1992713
Country: Netherlands
Volume: 52
Issue: 2
Start Page Number: 191
End Page Number: 207
Publication Date: Aug 1991
Journal: Mathematical Programming
Authors: ,
Abstract:

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

Reviews

Required fields are marked *. Your email address will not be published.