Abstract

We first define a new class of generalized convex n-set functions, called (𝔉,b,ϕ,ρ,θ)-univex functions, and then establish a fairly large number of global parametric sufficient optimality conditions under a variety of generalized (𝔉,b,ϕ,ρ,θ)-univexity assumptions for a discrete minmax fractional subset programming problem.