“…A compromise solution may be found by using "Compromise Programming" which seeks the "shortest" distance between the ideal point and the set of nondominated solutions (Zeleny, 1973). Alternatively, game theory can be applied for finding the "maximum" distance between some "status quo" point and the set of nondominated solutions (Szidarovszky, et aL, 1978;Szidarovszky, A number of other techniques could be used as well (Roy, 1971;Benayoun, et aL, 1971;Haimes, et aL, 1975Haimes, et aL, , 1980Major, 1977;Cohon, 1978;Cohon, et aL, 1979;Goicoechea, et aL, 1979Goicoechea, et aL, , 1981 but as pointed out in Zionts and Wallenius (1 975), and Gershon (1 981), it is often advantageous to choose multiobjective techniques that are simple from the viewpoints of both decision maker and computations. It is hoped that Compromise Programming is acceptable on both accounts.…”