On Sub Convexlike Optimization Problems
In this paper, we show that the sub convexlikeness and subconvexlikeness defined by V. Jeyakumar are equivalent in locally convex topological spaces. We also deal with set-valued vector optimization problems and obtained vector saddle-point theorems and vector Lagrangian theorems.
Main Author: | Renying Zeng |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2023-06-01
|
Series: | Mathematics |
Subjects: | |
Online Access: | https://www.mdpi.com/2227-7390/11/13/2928 |
Similar Items
-
Fuzzy and l-Fuzzy Subset in a Locally Convex Topology
by: Sayed Khalil ELAGAN, et al.
Published: (2014-03-01) -
Saddle point theorems on generalized convex spaces
by: Park Sehie, et al.
Published: (2000-01-01) -
Strict Benson proper-ε-efficiency in vector optimization with set-valued maps
by: Suneja Kaur Surjeet, et al.
Published: (2015-01-01) -
Existence of solutions for a fourth order problem at resonance
by: EL Miloud Hssini, et al.
Published: (2014-09-01) -
Existence and multiplicity of solutions for class of Navier boundary $p$-biharmonic problem near resonance
by: Mohammed Massar, et al.
Published: (2014-09-01)