Duality in fractional minimax programming

Abstract

Abstract Certain omissions in the recently introduced dual for fractional minimax programming problem ‘minimize max y ∈ Y f(x, y) / h(x, y), subject to g (x) ≤ 0’, are indicated and two modified duals for this problem are presented. Various fractional programming and generalized fractional programming duals are shown to be special cases of this study.