Approximate solutions for nonconvex set-valued optimization and vector variational inequality
From MaRDI portal
Recommendations
- Approximate solutions for set-valued optimization problems involving cone-subpreinvexity
- scientific article; zbMATH DE number 7108324
- Some properties of approximate solutions for vector optimization problem with set-valued functions
- Optimality of approximate solutions in set-valued optimization involving subarcwise connected cone-convexity
- Optimal conditions and duality of approximate efficient solutions for set-valued vector optimization problems
Cites work
- -optimality conditions of vector optimization problems with set-valued maps based on the algebraic interior in real linear spaces
- \(\mathbb{T}\)-epiderivatives of set-valued maps and its application to set optimization and generalized variational inequalities
- About contingent epiderivatives
- Contingent epiderivatives and set-valued optimization
- Continuity concepts for set-valued functions and a fundamental duality formula for set-valued optimization
- Duality for set-valued multiobjective optimization problems. I: Mathematical programming
- Existence and optimality conditions for approximate solutions to vector optimization problems
- Exponential type vector variational-like inequalities and nonsmooth vector optimization problems
- Exponential type vector variational-like inequalities and vector optimization problems with exponential type invexities
- Generalized vector variational-like inequalities and vector optimization
- Invex multifunctions and duality
- Invex optimisation problems
- Lagrangian conditions for approximate solutions on nonconvex set-valued optimization problems
- Lagrangian duality for preinvex set-valued functions
- Lagrangian duality for vector optimization problem with set-valued mappings
- On approximate solutions in set-valued optimization problems
- On characterization of solution sets of set-valued pseudoinvex optimization problems
- On sufficiency of the Kuhn-Tucker conditions
- Optimality conditions for a nonconvex set-valued optimization problem
- Optimality conditions for Henig and globally proper efficient solutions with ordering cone has empty interior
- Optimality conditions for set-valued optimization problems
- Optimality criteria in set-valued optimization
- Optimality of global proper efficiency for cone-arcwise connected set-valued optimization using contingent epiderivative
- Proper efficiency for set-valued vector optimization problems and vector variational in\-equalities.
- Relations between generalized vector variational-like inequalities and vector optimization problems
- Scalarization and optimality conditions for strict minimizers in multiobjective optimization via contingent epiderivatives
- Set-valued analysis
- Strong duality for proper efficiency in vector optimization
- Strong Duality with Proper Efficiency in Multiobjective Optimization Involving Nonconvex Set-Valued Maps
- Sufficient optimality conditions and duality theorems for set-valued optimization problem under generalized cone convexity
- The existence of contingent epiderivatives for set-valued maps
- Variational characterization of the contingent epiderivative
- Vector optimization. Set-valued and variational analysis.
Cited in
(5)- Scalarization and optimality conditions for the approximate solutions to vector variational inequalities in Banach spaces
- Approximate solutions for set-valued optimization problems involving cone-subpreinvexity
- scientific article; zbMATH DE number 7108324 (Why is no real title available?)
- Globally proper efficiency of set-valued optimization and vector variational inequality involving the generalized contingent epiderivative
- Some properties of approximate solutions for vector optimization problem with set-valued functions
This page was built for publication: Approximate solutions for nonconvex set-valued optimization and vector variational inequality
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q262585)
