Article Title
Abstract
In this paper, we discuss nondifferentiable minimax fractional programming problem where the involved functions are locally Lipschitz. Furthermore, weak, strong and strict converse duality theorems are proved in the setting of Mond-Weir type dual under the assumption of generalized (F,α,P,d)-convexity.
Suggested Reviewers
N/A
Digital Object Identifier (DOI)
http://dx.doi.org/10.12785/amis/090120
Recommended Citation
M. Al-roqi, Abdullah
(2015)
"Duality in Minimax Fractional Programming Problem Involving Nonsmooth Generalized (F,α,P,d)-Convexity,"
Applied Mathematics & Information Sciences: Vol. 09
:
Iss.
1
, Article 20.
DOI: http://dx.doi.org/10.12785/amis/090120
Available at:
https://dc.naturalspublishing.com/amis/vol09/iss1/20