Approximate quasi efficiency of set-valued optimization problems via weak subdifferential
From MaRDI portal
Publication:1689268
DOI10.1007/s40324-016-0099-4zbMath1380.90280OpenAlexW2555157742MaRDI QIDQ1689268
Publication date: 12 January 2018
Published in: S\(\vec{\text{e}}\)MA Journal (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s40324-016-0099-4
Optimality conditions and duality in mathematical programming (90C46) Duality theory (optimization) (49N15) Convexity of real functions of several variables, generalizations (26B25)
Related Items (5)
Using \(\rho \)-cone arcwise connectedness on parametric set-valued optimization problems ⋮ PARAMETRIC SET-VALUED OPTIMIZATION PROBLEMS UNDER GENERALIZED CONE CONVEXITY ⋮ On constrained set-valued optimization problems with \(\rho\)-cone arcwise connectedness ⋮ Unnamed Item ⋮ Set-valued optimization problems via second-order contingent epiderivative
Cites Work
- Unnamed Item
- Unnamed Item
- \(\varepsilon \)-mixed type duality for nonconvex multiobjective programs with an infinite number of constraints
- Lagrangian conditions for approximate solutions on nonconvex set-valued optimization problems
- A generic approach to approximate efficiency and applications to vector optimization with set-valued maps
- Generalized \(\varepsilon \)-quasi-solutions in multiobjective optimization problems: existence results and optimality conditions
- Some properties of approximate solutions for vector optimization problem with set-valued functions
- On \(\varepsilon\)-optimality conditions for convex set-valued optimization problems
- \(\epsilon\)-solutions in vector minimization problems
- Conjugate maps and duality in multiobjective optimization
- Optimality conditions for set-valued optimization problems
- Optimization of set-valued functions
- Optimality conditions for proper efficient solutions of vector set-valued optimization.
- \(\varepsilon\)-optimality for multiobjective programming on a Banach space
- Optimality via generalized approximate convexity and quasiefficiency
- Sufficient optimality conditions and duality theorems for set-valued optimization problem under generalized cone convexity
- \(\epsilon\)-duality of nondifferentiable nonconvex multiobjective programming
- \(\varepsilon\)-subdifferentials of set-valued maps and \(\varepsilon\)-weak Pareto optimality for multiobjective optimization
- Multiplier rules and saddle-point theorems for Helbig's approximate solutions in convex Pareto problems
- Necessary optimality conditions and saddle points for approximate optimization in Banach space
- Optimality conditions for approximate quasi efficiency in set-valued equilibrium problems
- ON APPROXIMATE MINIMA IN VECTOR OPTIMIZATION
- Two Types of Approximate Saddle Points
- ε-Optimality Conditions for Vector Optimization Problems with Set-Valued Maps
- Multivalued convexity and optimization: A unified approach to inequality and equality constraints
- ε-approximate solutions in multiobjective optimization
- The Lagrange Multiplier Rule in Set-Valued Optimization
- Optimality Conditions for Several Types of Efficient Solutions of Set-Valued Optimization Problems
- e-weak minimal solutions of vector optimization problems with set-valued maps
This page was built for publication: Approximate quasi efficiency of set-valued optimization problems via weak subdifferential
