HIGHER-ORDER DUALITY FOR MINIMAX FRACTIONAL PROGRAMMING PROBLEM CONTAINING ARBITRARY NORMS

In the present paper, we formulate a higher-order dual model for a minimax fractional programming problem containing arbitrary norms. Subsequently, we derive appropriate duality theorems under the concept of higher-order (Φ, ρ)-invex function. Moreover, an example has given to show the existence of aforesaid invexity.