Higher order duality in multiobjective fractional programming problem with generalized convexity
Praveer Pankaj, Bhuwan Joshi
Abstract
Open-access reader
Praveer Pankaj, Bhuwan Joshi
Abstract
Open-access reader
We have introduced higher order generalized hybrid B -(b,?,?,??,?r)-invex function. Then, we have estabilished 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,?,?,??,?r)-invex functions. Our results extend and unify several results from the literature.
OpenAlex reports 4 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
We have introduced higher order generalized hybrid B -(b,?,?,??,?r)-invex function. Then, we have estabilished 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,?,?,??,?r)-invex functions. Our results extend and unify several results from the literature.
Key concepts: Fractional programming, Mathematics, Convexity, Duality (order theory), Converse, Order (exchange), Function (biology), Multiobjective programming