Strict efficiency in vector optimization with nearly convexlike set-valued maps
Summary: The concept of the well posedness for a special scalar problem is linked with strictly efficient solutions of vector optimization problems involving nearly convexlike set-valued maps. Two scalarization theorems and two Lagrange multiplier theorems for strict efficiency in vector optimization involving nearly convexlike set-valued maps are established. A dual is proposed and duality results are obtained in terms of strictly efficient solutions. A new type of saddle points, called strict saddle point, of an appropriate set-valued Lagrange map is introduced and is used to characterize strict efficiency.
- Nearly subconvexlike set-valued maps and vector optimization problems
- Strict efficiency of set-valued optimization and scalar set-valued Lagrange mapping
- Tightly proper efficiency in vector optimization with nearly cone-subconvexlike set-valued maps
- Super efficiency in vector optimization with nearly convexlike set-valued maps.
- ∊-STRICTLY EFFICIENT SOLUTIONS OF VECTOR OPTIMIZATION PROBLEMS WITH SET-VALUED MAPS
- An improved definition of proper efficiency for vector maximization with respect to cones
- Benson proper efficiency in the vector optimization of set-valued maps
- Characterization of solutions of multiobjective optimization problem
- Characterizations of super efficiency in cone-convexlike vector optimization with set-valued maps
- Degrees of Efficiency and Degrees of Minimality
- Existence and Lagrangian duality for maximization of set-valued functions
- scientific article; zbMATH DE number 3926624 (Why is no real title available?)
- scientific article; zbMATH DE number 1460256 (Why is no real title available?)
- Lagrangian duality for minimization of nonconvex multifunctions
- Lagrangian multipliers, saddle points, and duality in vector optimization of set-valued maps
- Near-subconvexlikeness in vector optimization with set-valued functions
- Nonconvex vector optimization of set-valued mappings.
- On Cone-Efficiency, Cone-Convexity and Cone-Compactness
- Optimality conditions for set-valued optimization problems
- Proper efficiency and the theory of vector maximization
- Proper efficiency with respect to cones
- Proper Efficient Points for Maximizations with Respect to Cones
- Super Efficiency in Vector Optimization
- Super efficiency in vector optimization with nearly convexlike set-valued maps.
- Superefficiency in vector optimization with nearly subconvexlike set-valued maps
- Tangent Cones, Generalized Gradients and Mathematical Programming in Banach Spaces
- Strict efficiency in vector optimization with ic-cone-convexlike set-valued functions
- scientific article; zbMATH DE number 5926450 (Why is no real title available?)
- scientific article; zbMATH DE number 5283948 (Why is no real title available?)
- ∊-STRICTLY EFFICIENT SOLUTIONS OF VECTOR OPTIMIZATION PROBLEMS WITH SET-VALUED MAPS
- Strict efficiency in set-valued optimization
- scientific article; zbMATH DE number 2165713 (Why is no real title available?)
- Strict efficiency of set-valued optimization and scalar set-valued Lagrange mapping
- scientific article; zbMATH DE number 2201980 (Why is no real title available?)
- Nearly subconvexlike set-valued maps and vector optimization problems
- Tightly proper efficiency in vector optimization with nearly cone-subconvexlike set-valued maps
This page was built for publication: Strict efficiency in vector optimization with nearly convexlike set-valued maps
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q370046)
