Arcwise connected cone-quasiconvex set-valued mappings and Pareto reducibility in vector optimization

DOI10.1186/s13660-015-0838-6zbMath1333.90122OpenAlexW1939430331WikidataQ59434089 ScholiaQ59434089MaRDI QIDQ262567

Guolin Yu

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-0838-6

zbMATH Keywords

set-valued optimizationarcwise connected cone-quasiconvexityGerstewitz's scalarization functionPareto reducibility

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Optimality conditions and duality in mathematical programming (90C46) Convexity of real functions of several variables, generalizations (26B25)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Nonconvex separation theorems and some applications in vector optimization
• Nonconvex scalarization in set optimization with set-valued maps
• Arcwise cone-quasiconvex multicriteria optimization
• Generalized arcwise-connected functions and characterizations of local- global minimum properties
• Arcwise connected cone-convex functions and mathematical programming
• Characterizations of convex and quasiconvex set-valued maps
• Optimality conditions and duality on approximate solutions in vector optimization with arcwise connectivity
• Scalarization in set optimization with solid and nonsolid ordering cones
• On three concepts of quasiconvexity in vector optimization
• Explicitly quasiconvex set-valued optimization
• Scalar characterizations of weakly cone-convex and weakly cone-quasiconvex functions
• Nonlinear Scalarizations of Set Optimization Problems with Set Orderings
• On Efficient Solutions to Multiple Objective Mathematical Programs
• A characterization of quasiconvex vector-valued functions
• Scalarization of Set-Valued Optimization Problems in Normed Spaces
• Pareto reducible multicriteria optimization problems

This page was built for publication: Arcwise connected cone-quasiconvex set-valued mappings and Pareto reducibility in vector optimization