Duality for Unified Higher-Order Minimax Fractional Programming with Support Function under Type-I Assumptions

Abstract

This article is devoted to discussing the nondifferentiable minimax fractional programming problem with type-I functions. We focus our study on a nondifferentiable minimax fractional programming problem and formulate a higher-order dual model. Next, we establish weak, strong, and strict converse duality theorems under generalized higher-order strictly pseudo ( V , α , ρ , d ) -type-I functions. In the final section, we turn our focus to study a nondifferentiable unified minimax fractional programming problem and the results obtained in this paper naturally unify. Further, we extend some previously known results on nondifferentiable minimax fractional programming in the literature.

Keywords

• duality
• support function
• nondifferentiable
• strictly pseudo (v,α,ρ,d)-type-i
• unified dual
• efficient solutions