Surrogate duality for robust quasiconvex vector optimization

In this paper, we study quasiconvex vector optimization with data uncertainty via robust optimization. By using scalarization, we introduce two types of surrogate duality theorems for robust quasiconvex vector optimization. We show surrogate min-max duality theorems for quasiconvex vector optimization with uncertain objective and/or constraints. For the problem with uncertain objective, we introduce its robust counterpart as a set-valued optimization problem.