Optimality and Duality for Multi-objective Fractional Programming in Complex Spaces

In this paper, we consider a complex multi-objective fractional programming problem (CMFP). We establish the necessary optimality conditions of problem (CMFP) in the sense of Pareto optimality and derive its sufficient optimality conditions using generalized convexity. Finally, we construct the para...

Full description

Saved in:
Bibliographic Details
Published inBulletin of the Malaysian Mathematical Sciences Society Vol. 44; no. 6; pp. 3895 - 3906
Main Authors Huang, Tone-Yau, Ho, Shun-Chin
Format Journal Article
LanguageEnglish
Published Singapore Springer Singapore 01.11.2021
Springer Nature B.V
Subjects
Applications of Mathematics
Convexity
Mathematical programming
Mathematics
Mathematics and Statistics
Duality theorems
90C32
90C46
90C29
Multi-objective fractional programming
Generalized convexity
49K35
Online AccessGet full text

Cover

More Information
Summary:In this paper, we consider a complex multi-objective fractional programming problem (CMFP). We establish the necessary optimality conditions of problem (CMFP) in the sense of Pareto optimality and derive its sufficient optimality conditions using generalized convexity. Finally, we construct the parametric dual problem to the primal problem (CMFP) and their duality theorems.
ISSN:0126-6705
2180-4206
DOI:10.1007/s40840-021-01151-6