不定期多目标动态规划问题的非劣矩阵解法
Method of Noninferior Matrix of Multi-objective Dynamic Programming with Indefinite Phases
-
摘要: 针对不定期多目标规划问题,指出其一般只存在非劣解的性质,提出了不定期多目标阶段收益非劣合成 矩阵、不定期多目标递推矩阵等概念.在此基础上构造出不定期多目标动态规划问题的非劣矩阵解法.该方法不 要求事先给出各目标的相应权重,并能保证找到所有非劣解.文中给出的计算实例验证了这一方法的正确性和 实用价值.Abstract: From the fact that multi-objective programming with indefinite phases has usually only noninferior solutions, the concepts of the noninferior compound matrix of phase return and the recurrence matrix for multi-objective programming with indefinite phases were put forward. Based on these concepts, method of noninferior matrix to solve multi-objective dynamic programming problems with indefinite phases was given. In this method, it is not necessary to give the relative weights of objectives beforehand, and all the noninferior solutions can be gotten easily. The validity of the method was verified by an example.
-
Key words:
- multi-objective programming /
- noninferior solution /
- noninferior matrix
点击查看大图
计量
- 文章访问数: 1395
- HTML全文浏览量: 67
- PDF下载量: 74
- 被引次数: 0