Higher-order duality in nondifferentiable minimax fractional programming involving generalized convexity

被引:0
|
作者
I Ahmad
机构
[1] King Fahd University of Petroleum and Minerals,Department of Mathematics and Statistics
[2] Aligarh Muslim University,Department of Mathematics
关键词
fractional programming; nondifferentiable programming; higher-order duality; optimal solutions; generalized higher-order convexity;
D O I
暂无
中图分类号
学科分类号
摘要
A higher-order dual for a non-differentiable minimax fractional programming problem is formulated. Using the generalized higher-order η-convexity assumptions on the functions involved, weak, strong and strict converse duality theorems are established in order to relate the primal and dual problems. Results obtained in this paper naturally unify and extend some previously known results on non-differentiable minimax fractional programming in the literature.
引用
收藏
相关论文
共 50 条