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.
Khan, M. A., & Al-Solamy, F. R. (2015). Sufficiency and duality in nondifferentiable minimax fractional programming with ðHp;rÞ-invexity. Journal of the Egyptian Mathematical Society, 23(1), 208-213. doi: 10.1016/j.joems.2014.01.010
MLA
Meraj Ali Khan; Falleh R. Al-Solamy. "Sufficiency and duality in nondifferentiable minimax fractional programming with ðHp;rÞ-invexity", Journal of the Egyptian Mathematical Society, 23, 1, 2015, 208-213. doi: 10.1016/j.joems.2014.01.010
HARVARD
Khan, M. A., Al-Solamy, F. R. (2015). 'Sufficiency and duality in nondifferentiable minimax fractional programming with ðHp;rÞ-invexity', Journal of the Egyptian Mathematical Society, 23(1), pp. 208-213. doi: 10.1016/j.joems.2014.01.010
VANCOUVER
Khan, M. A., Al-Solamy, F. R. Sufficiency and duality in nondifferentiable minimax fractional programming with ðHp;rÞ-invexity. Journal of the Egyptian Mathematical Society, 2015; 23(1): 208-213. doi: 10.1016/j.joems.2014.01.010
)
View on SCiNiTO