Answers are grounded in this paper and cite their sources.
In this paper by using the scalariation method we introduced the concept of relaxed K-preinvex set-valued maps and obtain some equivalence results of them in terms of normal subdifferential. Also, we consider generalized Minty variational-like inequalities and show that the set of solutions is equal to scalarized set-valued optimization problems?s solutions under generalized relaxed convexity assumptions.
No takes yet. Share an insight, caveat, or question.
Oveisiha et al. (2017) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: