Conic scalarizations for approximate efficient solutions in nonconvex vector optimization problems

DOI10.1007/s40305-016-0139-xzbMath1391.90550OpenAlexW2546952094MaRDI QIDQ1697907

Hui Guo, Wan Li Zhang

Publication date: 20 February 2018

Published in: Journal of the Operations Research Society of China (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s40305-016-0139-x

zbMATH Keywords

nonlinear scalarizationimprovement setapproximate efficient points

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Nonlinear programming (90C30)

Related Items (1)

Sublinear scalarizations for proper and approximate proper efficient points in nonconvex vector optimization

Cites Work

• Unnamed Item
• Unnamed Item
• Weak \(E\)-optimal solution in vector optimization
• Characterizations of the \(E\)-Benson proper efficiency in vector optimization problems
• Nonlinear scalarization characterizations of \(e\)-efficiency in vector optimization
• Vector optimization problems via improvement sets
• An improved definition of proper efficiency for vector maximization with respect to cones
• Variational methods in partially ordered spaces
• Improvement sets and vector optimization
• Vector optimization. Set-valued and variational analysis.
• A unified vector optimization problem: complete scalarizations and applications
• A Nonlinear Cone Separation Theorem and Scalarization in Nonconvex Vector Optimization
• E-Benson proper efficiency in vector optimization
• A Unified Approach and Optimality Conditions for Approximate Solutions of Vector Optimization Problems
• e-weak minimal solutions of vector optimization problems with set-valued maps

This page was built for publication: Conic scalarizations for approximate efficient solutions in nonconvex vector optimization problems