Nearly subconvexlike set-valued maps and vector optimization problems
From MaRDI portal
Recommendations
- Some applications of near \((C, \varepsilon)\)-subconvexlikeness in vector optimization problems with set-valued maps
- Strong efficient solutions of nearly cone-subconvexlike set-valued vector optimization problems characterized by generalized saddle point
- Strict efficiency in vector optimization with nearly convexlike set-valued maps
- Benson proper efficiency in the nearly cone-subconvexlike vector optimization with set-valued functions.
- Scalarization and saddle points of approximate proper solutions in nearly subconvexlike vector optimization problems
Cites work
- scientific article; zbMATH DE number 1046022 (Why is no real title available?)
- A characterization of proper minimal points as solutions of sublinear optimization problems
- A theorem of the alternative and its application to the optimization of set-valued maps
- Alternative theorems and optimality conditions with weakened convexity
- Benson proper efficiency in the vector optimization of set-valued maps
- Characterizations of the Benson proper efficiency for nonconvex vector optimization
- Convexlike alternative theorems and mathematical programming
- Convexlike and concavelike conditions in alternative, minimax, and minimization theorems
- Lagrange multipliers and saddle points in multiobjective programming
- Minimax Theorems
- Near-subconvexlikeness in vector optimization with set-valued functions
- Theorems of the alternative and optimization with set-valued maps
Cited in
(34)- ε-Optimality Conditions for Vector Optimization Problems with Set-Valued Maps
- Strong duality with super efficiency in set-valued optimization
- scientific article; zbMATH DE number 5283948 (Why is no real title available?)
- New generalized convexity notion for set-valued maps and application to vector optimization
- Superefficiency in vector optimization with nearly subconvexlike set-valued maps
- Moreau-Rockafellar theorems for nonconvex set-valued maps
- Adjusted Sublevel Sets, Normal Operator, and Quasi-convex Programming
- Tightly proper efficiency in vector optimization with nearly cone-subconvexlike set-valued maps
- Strong Duality with Proper Efficiency in Multiobjective Optimization Involving Nonconvex Set-Valued Maps
- A super subgradient for a set-valued map and its applications
- Approximate weakly efficient solutions of set-valued vector equilibrium problems
- The effects of adding objectives to an optimisation problem on the solution set
- Scalarizations and optimality of constrained set-valued optimization using improvement sets and image space analysis
- Lagrangian duality in set-valued optimization
- Approximate duality for vector quasi-equilibrium problems and applications
- Strict efficiency in vector optimization with nearly convexlike set-valued maps
- Duality results for generalized vector variational inequalities with set-valued maps
- Near-subconvexlikeness in vector optimization with set-valued functions
- Subdifferentials for Set-valued Maps and Optimality Conditions for Set-valued Vector Optimization
- Strong efficient solutions of nearly cone-subconvexlike set-valued vector optimization problems characterized by generalized saddle point
- An optimal alternative theorem and applications to mathematical programming
- The generalized vector convex-like mappings on real linear spaces
- Generalized saddle point characterization of strictly efficient solutions in nearly cone-subconvexlike set-valued optimization problems
- Scalarization and saddle points of approximate proper solutions in nearly subconvexlike vector optimization problems
- On super efficiency in set-valued optimization
- Weak \(E\)-optimal solution in vector optimization
- Characterizations of efficiency in vector optimization with \(\mathcal C(T)\)-valued mappings
- Optimality conditions of generalized subconvexlike set-valued optimization problems based on the quasi-relative interior
- Improved \(\varepsilon\)-constraint method for multiobjective programming
- Approximate Benson efficient solutions for set-valued equilibrium problems
- Some applications of near \((C, \varepsilon)\)-subconvexlikeness in vector optimization problems with set-valued maps
- Higher-order variational sets and higher-order optimality conditions for proper efficiency in set-valued nonsmooth vector optimization
- Scalarizations and Lagrange multipliers for approximate solutions in the vector optimization problems with set-valued maps
- Hartley proper efficiency in multiobjective optimization problems with locally Lipschitz set-valued objectives and constraints
This page was built for publication: Nearly subconvexlike set-valued maps and vector optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q597175)
