`a`
Journal of Industrial and Management Optimization (JIMO)
 

On minimax fractional programming problems involving generalized $(H_p,r)$-invex functions

Pages: 1001 - 1018, Volume 10, Issue 4, October 2014      doi:10.3934/jimo.2014.10.1001

 
       Abstract        References        Full Text (644.6K)       Related Articles       

Anurag Jayswal - Department of Applied Mathematics, Indian School of Mines, Dhanbad-826004, India (email)
Ashish Kumar Prasad - Department of Applied Mathematics, Indian School of Mines, Dhanbad-826004, India (email)
Izhar Ahmad - Department of Mathematics and Statistics, King Fahd University of Petroleum and Minerals, Dhahran-31261, Saudi Arabia (email)

Abstract: In the present paper, we move forward in the study of minimax fractional programming problem and establish sufficient optimality conditions under the assumptions of generalized $(H_p,r)$-invexity. Weak, strong and strict converse duality theorems are also derived for two types of dual models related to minimax fractional programming problem involving aforesaid invex functions. In order to show the existence of introduced class of functions, examples are given.

Keywords:  Minimax fractional programming, $(H_p,r)$-invexity, sufficiency, duality.
Mathematics Subject Classification:  Primary: 90C32, 49K35; Secondary: 49N15.

Received: May 2012;      Revised: July 2013;      Available Online: February 2014.

 References