In this chapter we present and prove dierent forms of weak, strong and converse
duality theorems for the Wolfe and Mond-Weir dual problems associated with the
vector optimization problem with constraints, where the vector objective function and
the vector function associated with the inequality-type constraints are invex, strictly
invex or quasi-invex.
