In this paper we extend the concept of invexity to set-valued maps and study vector optimisation problems with invex set-valued data. Necessary and sufficient optimality conditions are established in terms of contingent derivatives. Wolfe type dual problems are constructed via two recently developed approaches which guarantee the zero-gap duality property.