摘要
提出了一种求解多目标线性规划问题的人机对话方法，其基本原理与ＳＴＥＭ方法大致相同，但采用了两人零和混合对策思想确定Ｔｃｈｅｂｙｃｈｅｖ距离中的相对权重。
A new interactive multi objective linear programming method is presented, which is principally similar to the STEM method. However, during the interactive process, the sequentially varying 'relative ideal points' are used instead of the original ideal point, and the deviation weights of the generalized Tchebychev distance to the 'relative ideal points' are determined using game theory, the weights determined in this way are more reasonable than those determined in classical ways.
出处
《系统工程学报》
CSCD
1996年第4期61-68,共8页
Journal of Systems Engineering
基金
国家教委留学回国人员科研基金
关键词
多目标线性规划
矩阵对策
线性规划
multiobjective linear programming, efficient solution, matrix game, interactive method
