Higher order parameter-free optimality models for discrete minmax fractional programming

Abstract

Several sets of generalized parameter - free sufficient optimality conditions for a discrete minmax fractional programming problem using two partitioning schemes and various second - order (F,β, θ,φ, ρ, θ,m) - univexity constraints are established. The obtained optimality results are application - oriented to other problems in mathematical programming in the interdisciplinary nature as well.