Higher-order parameter-free sufficient optimality conditions in discrete minmax fractional programming

Abstract

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 $(\phi,\eta,\rho,\theta,m)$-invex functions, which generalize most of the concepts available in the literature.