A note on duality for fractional programming problems (Q1065720)

Consider the fractional programming problem: minimize f(x)/g(x) subject to h(x)\(\leq 0\) where \(g(x)>0\) for all feasible x. Many duals to this problem can be found in the literature under a variety of convexity conditions. Here the author gives different duals that allow further weakening of the convexity requirements. Dual theorems are also given that make use of strong and weak generalized convex functions.