In generalized fractional programming, one seeks to minimize the maxim
um of a finite number of ratios. Such programs are, in general, noncon
vex and consequently are difficult to solve. Here, we consider a parti
cular case in which the ratio is the quotient of a quadratic form and
a positive concave function. The dual of such a problem is constructed
and a numerical example is given.