Abstract

We construct three parametric duality models and establish a fairly large number of duality results under a variety of generalized (,b,ϕ,ρ,θ)-univexity assumptions for a discrete minmax fractional subset programming problem.