Approximate weak efficiency of the set-valued optimization problem with variable ordering structures

In locally convex spaces, we introduce the new notion of approximate weakly efficient solution of the set-valued optimization problem with variable ordering structures (in short, SVOPVOS) and compare it with other kinds of solutions. Under the assumption of near D ( · ) -subconvexlikeness, we establ...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Journal of combinatorial optimization 2024-10, Vol.48 (3), Article 27
Hauptverfasser:	Zhou, Zhiang, Wei, Wenbin, Huang, Fei, Zhao, Kequan
Format:	Artikel
Sprache:	eng
Schlagworte:	Combinatorics Convex and Discrete Geometry Convexity Mathematical Modeling and Industrial Mathematics Mathematics Mathematics and Statistics Operations Research/Decision Theory Optimization Theorems Theory of Computation
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!