Approximate weak efficiency of the set-valued optimization problem with variable ordering structures
From MaRDI portal
Recommendations
- Approximate proper solutions in vector optimization with variable ordering structure
- Approximate efficiency in set-valued optimization with variable order
- A coradiant based scalarization to characterize approximate solutions of vector optimization problems with variable ordering structures
- Approximate solutions and scalarization in set-valued optimization
- Characterization of approximate solutions of vector optimization problems with a variable order structure
Cites work
- A Nonlinear Cone Separation Theorem and Scalarization in Nonconvex Vector Optimization
- A theorem of the alternative and its application to the optimization of 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
- Characterizations of the Benson proper efficiency for nonconvex vector optimization
- Characterizations of variable domination structures via nonlinear scalarization
- Cone convexity, cone extreme points, and nondominated solutions in decision problems with multiobjectives
- Dual Characterization and Scalarization for Benson Proper Efficiency
- e-weak minimal solutions of vector optimization problems with set-valued maps
- Existence of solutions for a vector variational inequality: An extension of the Hartmann-Stampacchia theorem
- Hartley properly and super nondominated solutions in vector optimization with a variable ordering structure
- Henig efficiency in vector optimization with nearly cone-subconvexlike set-valued functions
- 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 Separation Functional in Linear Spaces with Applications to Vector Equilibria
- Nonconvex separation theorems and some applications in vector optimization
- Nonlinear Cone Separation Theorems in Real Topological Linear Spaces
- Optimal elements in vector optimization with a variable ordering structure
- Optimization of set-valued functions
- Proper efficiency and the theory of vector maximization
- Proper efficiency with respect to cones
- Proper Efficient Points for Maximizations with Respect to Cones
- Properly optimal elements in vector optimization with variable ordering structures
- Scalarization and Optimality Conditions of E-Globally Proper Efficient Solution for Set-Valued Equilibrium Problems
- Set-valued analysis
- Set-valued optimization. An introduction with applications
- Super Efficiency in Vector Optimization
- Superefficiency in vector optimization with nearly subconvexlike set-valued maps
- Tangent Cones, Generalized Gradients and Mathematical Programming in Banach Spaces
This page was built for publication: Approximate weak efficiency of the set-valued optimization problem with variable ordering structures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6646747)
