On Higher-order Duality in Nondifferentiable Minimax Fractional Programming

Authors

S. Al-Homidan, King Fahd University of Petroleum and Minerals
Vivek Singh, Indian Institute of Technology (Indian School of Mines)
I. Ahmad, King Fahd University of Petroleum and Minerals

Abstract

In this paper, we consider a nondifferentiable minimax fractional programming problem with continuously differentiable functions and formulate two types of higher-order dual models for such optimization problem. Weak, strong and strict converse duality theorems are derived under higher- order generalized invexity.

Recommended Citation

Al-Homidan, S.; Singh, Vivek; and Ahmad, I. (2021). On Higher-order Duality in Nondifferentiable Minimax Fractional Programming, Applications and Applied Mathematics: An International Journal (AAM), Vol. 16, Iss. 1, Article 22.
Available at: https://digitalcommons.pvamu.edu/aam/vol16/iss1/22