This paper proposes a hierarchical procedure for solving decision problems with multiple objectives. The procedure consists of two levels, a top- and a base-level. The main idea is that the top-level only provides general preference information. Taking this information into account the base-level then determines a compromise solution. For a multi-objective linear program it will be shown how such a hierarchical procedure can be structured by deriving weight restrictions from the general prefecence information of the top-level and by using the interactive MODM procedure of Zionts and Wallenius.
Dieser Eintrag ist Teil der Universitätsbibliographie.
Search Authors in