A Note on Size Reduction of the Objective Functions Matrix in Vector Maximum Problems

In vector maximum problems among the given objective functions may be some which do not influence the set of all efficient solutions. Deleting such objectives the matrix of the corresponding coefficients is reduced in size. Working with the size reduced matrix saves computer time when eg. a compromise solution is to be determined. A straightforward method is described how to determine at least a part of the deletable objective functions.