Approximate properly solutions of constrained vector optimization with variable coradiant sets

This paper concentrates on a general vector optimization problem (VOP) with geometrical constraints, where the variable domination structures are defined by coradiant sets. Utilizing asymptotic and recession cones, we provide some new characterizations of coradiant sets. The related approximate weak...

Full description

Saved in:
Bibliographic Details
Published inOptimization letters Vol. 17; no. 3; pp. 721 - 738
Main Authors You, Manxue, Li, Genghua
Format Journal Article
LanguageEnglish
Published Berlin/Heidelberg Springer Berlin Heidelberg 01.04.2023
Subjects
Computational Intelligence
Mathematics
Mathematics and Statistics
Numerical and Computational Physics
Operations Research/Decision Theory
Optimization
Original Paper
Simulation
Asymptotic and recession cone
Coradiant set
Approximate properly solution
Optimality condition
Approximate duality
Variable domination structure
Online AccessGet full text

Cover

More Information
Summary:This paper concentrates on a general vector optimization problem (VOP) with geometrical constraints, where the variable domination structures are defined by coradiant sets. Utilizing asymptotic and recession cones, we provide some new characterizations of coradiant sets. The related approximate weak and strong duality theorems between a general primal set and some different dual sets are formulated. Moreover, the corresponding duality theories are especially derived for VOP. Finally, several sufficient and necessary optimality conditions of approximate (properly) optimal solutions of VOP are proved by maximizing two different nonlinear scalarization functionals about objectives and constraints.
ISSN:1862-4472
1862-4480
DOI:10.1007/s11590-022-01902-9