An Interactive Satisficing Trade-Off Method for Solving Multicriteria Dynamic Programming
多指标动态规划的人机交互式满意权衡法

In 1984, Nakayama and Sawaragi proposed an interactive satisficing trade-off method for solving static multiobjective decision making problems. In this paper, by developing the idea of Nakayama's method and combining it with the structural characteristics of dynamic programming, we show that Nakayama's method can be extended so as to deal with multicriteria dynamic programming problems as well. Moreover,some inadequacy of the original method can be removed by a modification of the method. Our method, under weaker restrictions, can be used to obtain the sclution which is most satisfyactory to a decision maker for a class of quite general multicriteria dynamic programming models.