Higher order duality in multiobjective fractional programming problem with generalized convexity
Abstract
We have introduced higher order generalized hybrid B-(b;ρ ; θ; ~p; ~r)-invex function. Then we have established higher order weak, strong and
strict converse duality theorems for a multiobjective fractional programming problem with support function in the numerator of the objective function involving
higher order generalized hybrid B - (b; ; ; ~p; ~r)-invex functions. Our results extend and unify several results from the literature.
Keywords: Multiobjective fractional programming, Support function Duality Higher order B - (b;ρ ;θ ; ~p; ~r)-invex function.

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.