scientific article; zbMATH DE number 7108324
From MaRDI portal
Publication:5193825
DOI10.3969/J.ISSN.1005-3085.2019.01.005zbMATH Open1438.90303MaRDI QIDQ5193825FDOQ5193825
Authors: Xiangyu Kong, Guolin Yu, Sanyang Liu 
Publication date: 20 September 2019
Title of this publication is not available (Why is that?)
Recommendations
- On approximate solutions in set-valued optimization problems
- Approximate solutions and scalarization in set-valued optimization
- Set-valued approximation of multifunctions
- Approximate solutions of set-valued optimization problems using set-criteria
- Approximate solutions in set-valued optimization problems with applications to maximal monotone operators
- Approximate optimization of convex set functions
- Some properties of approximate solutions for vector optimization problem with set-valued functions
- Approximate solutions for nonconvex set-valued optimization and vector variational inequality
- scientific article; zbMATH DE number 1830716
- Approximation in multiobjective optimization
Convex programming (90C25) Multi-objective and goal programming (90C29) Optimality conditions and duality in mathematical programming (90C46) Approximation methods and heuristics in mathematical programming (90C59)
Cited In (10)
- Optimal conditions and duality of approximate efficient solutions for set-valued vector optimization problems
- Optimality and duality for non-Lipschitz multiobjective optimization problems
- Optimality and duality in set-valued optimization utilizing limit sets
- Approximate solutions for nonconvex set-valued optimization and vector variational inequality
- Duality theorems for a nonconvex set-valued optimization problem
- The value functions approach and Hopf-Lax formula for multiobjective costs via set optimization
- Approximate solutions and scalarization in set-valued optimization
- Sufficient optimality conditions and duality theorems for set-valued optimization problem under generalized cone convexity
- Approximate solutions for set-valued optimization problems involving cone-subpreinvexity
- Higher-order optimality conditions and duality for approximate solutions in non-convex set-valued optimization
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5193825)
