Optimal conditions and duality of approximate efficient solutions for set-valued vector optimization problems
From MaRDI portal
Publication:3306594
DOI10.13413/J.CNKI.JDXBLXB.2018464zbMATH Open1449.90362MaRDI QIDQ3306594FDOQ3306594
Authors: Xudong Meng
Publication date: 12 August 2020
Recommendations
- scientific article; zbMATH DE number 7108324
- Optimality conditions for approximate solutions of set-valued optimization under two criteria of vector and set
- Higher-order optimality conditions and duality for approximate solutions in non-convex set-valued optimization
- Approximate quasi efficiency of set-valued optimization problems via weak subdifferential
- Some properties of approximate Henig efficient solutions of set-valued optimization problems
dualityapproximate efficient solutionoptimal conditioncontingent derivativecone-subinvex set-valued map
Optimality conditions and duality in mathematical programming (90C46) Set-valued and variational analysis (49J53)
Cited In (9)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Approximate solutions for nonconvex set-valued optimization and vector variational inequality
- Optimality Conditions and Wolfe Duality Results for LU-Efficiency in Differentiable Vector Optimization Problems with Multiple Interval-Valued Objective Function and Vanishing Constraints
- Optimality conditions for approximate solutions of set-valued optimization under two criteria of vector and set
- Title not available (Why is that?)
- 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
- Approximate quasi efficiency of set-valued optimization problems via weak subdifferential
This page was built for publication: Optimal conditions and duality of approximate efficient solutions for set-valued vector optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3306594)