Duality in generalized nonlinear fractional programming

Abstract For generalized nonlinear fractional programming, two duals are introduced under four sets of assumptions, thus four theorems of strong duality are established. All the theorems are proved with the help of alternative theorems in the convex case, though the numerators and denominators of the ratios in the objective functions need not necessarily be either convex or concave.