Abstract
In this paper, approximate solutions of vector optimization problems are analyzed via a metrically consistent ?-efficient concept. Several properties of the ?-efficient set are studied. By scalarization, necessary and sufficient conditions for approximate solutions of convex and nonconvex vector optimization problems are provided; a characterization is obtained via generalized Chebyshev norms, attaining the same precision in the vector problem as in the scalarization.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have