Duality theory for fractional programming problems under \(\eta\)- convexity (Q1101019)

We prove duality theorems for the second order dual problems similar to those formulated by \textit{V. Jeyakumar} [ibid. 22, 24-41 (1985; Zbl 0559.90087)] and the first order dual problem discussed by \textit{S. Schaible} [Manage. Sci. 22, 858-867 (1976; Zbl 0338.90050)], \textit{C. R. Bector} [Z. Oper. Res., Ser. A 17, 183-193 (1973; Zbl 0267.90086)], \textit{B. Mond} and \textit{T. Weir} [J. Inf. Optimization Sci. 3, 105-124 (1982; Zbl 0493.90082)], \textit{V. Jeyakumar} [loc. cit.] and \textit{T. Weir} [Opsearch 2, 241-247 (1985; Zbl 0577.90081)], under different forms of \(\eta\)-convexity.