Higher-order duality in nondifferentiable minimax programming with generalized type I functions
A unified higher-order dual for a nondifferentiable minimax programming problem in the \(n\)-dimensional Euclidean space is formulated and some weak, strong and strict converse duality theorems under higher-order \((F,\alpha,\rho,d)\)-type I assumptions are established in this paper. The results extend the corresponding results of the second order duality problem.
scientific article; zbMATH DE number 5577265
scientific article