On sufficiency and duality for multi-objective interval-valued programs via parametrization

In this article, we consider the vector optimization problem with interval-valued objective and constraint functions and derive the sufficient optimality conditions for a feasible point to be an efficient point of the primal problem.Further, we formulate a Mond-Weir type dual model and establish the several duality results which relates the efficient point of primal and its dual programs.Moreover, examples are also given to verify the results.