Approximate solutions for nonconvex set-valued optimization and vector variational inequality
DOI10.1186/s13660-015-0839-5zbMath1333.90123OpenAlexW2123202395WikidataQ59434064 ScholiaQ59434064MaRDI QIDQ262585
Publication date: 30 March 2016
Published in: Journal of Inequalities and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1186/s13660-015-0839-5
approximate solutionsoptimality conditionscontingent epiderivativegeneralized invex set-valued mappings
Multi-objective and goal programming (90C29) Optimality conditions and duality in mathematical programming (90C46) Convexity of real functions of several variables, generalizations (26B25)
Related Items (1)
Cites Work
- Lagrangian conditions for approximate solutions on nonconvex set-valued optimization problems
- Relations between generalized vector variational-like inequalities and vector optimization problems
- On approximate solutions in set-valued optimization problems
- Generalized vector variational-like inequalities and vector optimization
- On characterization of solution sets of set-valued pseudoinvex optimization problems
- Exponential type vector variational-like inequalities and nonsmooth vector optimization problems
- \(\mathbb{T}\)-epiderivatives of set-valued maps and its application to set optimization and generalized variational inequalities
- Optimality conditions for Henig and globally proper efficient solutions with ordering cone has empty interior
- About contingent epiderivatives
- Duality for set-valued multiobjective optimization problems. I: Mathematical programming
- Optimality conditions for a nonconvex set-valued optimization problem
- Scalarization and optimality conditions for strict minimizers in multiobjective optimization via contingent epiderivatives
- On sufficiency of the Kuhn-Tucker conditions
- Optimality conditions for set-valued optimization problems
- Contingent epiderivatives and set-valued optimization
- Lagrangian duality for preinvex set-valued functions
- Proper efficiency for set-valued vector optimization problems and vector variational in\-equalities.
- The existence of contingent epiderivatives for set-valued maps
- Continuity concepts for set-valued functions and a fundamental duality formula for set-valued optimization
- Lagrangian duality for vector optimization problem with set-valued mappings
- Sufficient optimality conditions and duality theorems for set-valued optimization problem under generalized cone convexity
- Strong duality for proper efficiency in vector optimization
- Existence and optimality conditions for approximate solutions to vector optimization problems
- \(\epsilon\)-optimality conditions of vector optimization problems with set-valued maps based on the algebraic interior in real linear spaces
- Vector optimization. Set-valued and variational analysis.
- Exponential type vector variational-like inequalities and vector optimization problems with exponential type invexities
- Variational characterization of the contingent epiderivative
- OPTIMALITY OF GLOBAL PROPER EFFICIENCY FOR CONE-ARCWISE CONNECTED SET-VALUED OPTIMIZATION USING CONTINGENT EPIDERIVATIVE
- Invex multifunctions and duality
- Strong Duality with Proper Efficiency in Multiobjective Optimization Involving Nonconvex Set-Valued Maps
- Invex optimisation problems
- Optimality criteria in set-valued optimization
- Set-valued analysis
This page was built for publication: Approximate solutions for nonconvex set-valued optimization and vector variational inequality
