In this paper we study the problem of universally reducing a multistage vector optimization problem to a one-stage vector optimization problem. This paper draws heavily and modifies on results obtained in Aixerman and Malishevski [1986]. Given the importance of such problems as mathematical representations of real world phenomena, particularly in economics and the management sciences, the results reported here hae great interest. Our analysis is restricted to the case of finite sets of alternatives, and thus has independent appeal from the stand point of finite/discrete mathematics as well.