The purpose of this paper is to establish a fairly large number of sets of second-order parameter-free sufficient optimality conditions for a discrete minmax fractional programming problem. Our effort to accomplish this goal is by utilizing various new classes of generalized second-order (φ, η, ρ, θ, m)-invex functions, which generalize most of the concepts available in the literature.

Tbilisi Mathematical Journal, Vol. 10(2) (2017), pp. 211-233