Sufficiency and duality in nondifferentiable minimax fractional programming with ðHp;rÞ-invexity | ||||
Journal of the Egyptian Mathematical Society | ||||
Volume 23, Issue 1, 2015, Page 208-213 PDF (473.15 K) | ||||
Document Type: Original Article | ||||
DOI: 10.1016/j.joems.2014.01.010 | ||||
![]() | ||||
Authors | ||||
Meraj Ali Khan* 1; Falleh R. Al-Solamy2 | ||||
1Department of Mathematics, University of Tabuk, Tabuk, Saudi Arabia | ||||
2Department of Mathematics, King Abdulaziz University, P.O. Box 80015, Jeddah 21589, Saudi Arabia | ||||
Abstract | ||||
In the present paper, we discuss the optimality condition for an optimal solution to the problem and a dual model is formulated for a non differentiable minimax fractional programming problem. Weak, strong and strict converse duality results are concerned involving ðHp;rÞ-invexity. | ||||
Keywords | ||||
Minimax programming; Fractional programming; Sufficiency; Duality; Generalized ðHp; rÞ-invexity | ||||
Statistics Article View: 50 PDF Download: 17 |
||||