Two algorithms for solution of a vector optimization problem

Two algorithms are discussed whereby most preferable solutions are found in multi-criterion problems. Both satisfy the requirements to rational decision making techniques but rely on different information on the preference judgments. The one, proposed by J. Wilhelm, assumes the existence of a complete preference relation and uses relatively weak assumptions on the amount of data on that relation obtained from the decision maker. The other, proposed by G. Fandel, employs a decision making technique using the data on preferences that can also be readily obtained from the decision maker.