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

Mathematics

Rifaqat Ali¹  VishnuNarayan Mishra²  Ramu Dubey³ 

[1] Department of Mathematics, College of Science and Arts, Muhayil, King Khalid University, 61413 Abha, Saudi Arabia;Department of Mathematics, Indira Gandhi National Tribal University, Lalpur, Amarkantak, Anuppur, Madhya Pradesh 484887, India;Department of Mathematics, J C Bose University of Science and Technology, YMCA, Faridabad 121006, India;

关键词: duality;    support function;    nondifferentiable;    strictly pseudo (v,α,ρ,d)-type-i;    unified dual;    efficient solutions;   

DOI  :  10.3390/math7111034

来源: DOAJ

【 摘 要 】

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,\alpha ,\rho ,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.

【 授权许可】

Unknown