On second order duality of minimax fractional programming with square root term involving generalized B-(p, r)-invex functions

The advantage of second-order duality is that if a feasible point of the primal is given and first-order duality conditions are not applicable (infeasible), then we may use second-order duality to provide a lower bound for the value of primal problem. Consequently, it is quite interesting to discuss the duality results for the case of second order. Thus, we focus our study on a discussion of duality relationships of a minimax fractional programming problem under the assumptions of second order B-(p, r)-invexity. Weak, strong and strict converse duality theorems are established in order to relate the primal and dual problems under the assumptions. An example of a non trivial function has been given to show the existence of second order B-(p, r)-invex functions.