Generalized Second-Order Parameter-Free Optimality Conditions in Discrete Minmax Fractional Programming

摘要

In this paper, we plan to establish numerous sets of generalized parameter-free sufficient optimality conditions for a discrete minmax fractional programming problem. These results are derived by utilizing two partitioning schemes and various second-order (F,β,φ, ρ, θ, m) - univexity assumptions.