This paper proposes a hierarchical procedure for solving decision prob
lems with multiple objectives. The procedure consists of two levels, a
top- and base-level. The main idea is that the top-level only provide
s general preference information. Taking this information into account
the base-level then determines a compromise solution. For a multi-obj
ective Linear program it will be shown how such a hierarchical procedu
re can be structured by deriving weight restrictions from the general
preference information of the top-level and by using the interactive M
ODM procedure of Zionts and Wallenius on the base-level. (C) 1998 Else
vier Science B.V.