| 方案集团序及其应用 |
| |
| 引用本文： | 吴祈宗,侯福均.方案集团序及其应用[J].北京理工大学学报,2006,26(6):521-524. |
| |
| 作者姓名： | 吴祈宗 侯福均 |
| |
| 作者单位： | 北京理工大学,管理与经济学院,北京,100081;北京理工大学,管理与经济学院,北京,100081 |
| |
| 基金项目： | 北京理工大学校科研和教改项目 |
| |
| 摘 要： | 提出了集团序的概念和方法,建立方案之间的3种关系.基于这3种关系,对每个方案定义了3个集合.定义了方案集的集团序,给出了集团序的构造算法.对算法进行了时间复杂度分析,该算法的时间复杂度为O(n3).定义了方案的集团序指标和方案的集团优先关系.对方案集团序进行了稳定性分析,给出了方案集团序稳定的充分条件.最后给出一个应用实例.
|
| 关 键 词： | 方案集团序 稳定性 优先关系 |
| 文章编号： | 1001-0645(2006)06-0521-04 |
| 收稿时间： | 02 1 2006 12:00AM |
| 修稿时间： | 2006年2月1日 |
Aggregative Rank of Alternatives and Its Application |
| |
| WU Qi-zong,HOU Fu-jun.Aggregative Rank of Alternatives and Its Application[J].Journal of Beijing Institute of Technology(Natural Science Edition),2006,26(6):521-524. |
| |
| Authors: | WU Qi-zong HOU Fu-jun |
| |
| Institution: | School of Management and Economics, Beijing Institute of Technology, Beijing 100081, China |
| |
| Abstract: | The concept and approach of aggregative rank is given.Three kinds of alternative relations are proposed.Based on these relations,three alternative sets are defined with respect to each alternative.The aggregative rank is then defined and the algorithm for obtaining the aggregative rank from an alternative set is proposed.The time complexity is analyzed.The worst-case time complexity of the algorithm is O(n~3).The aggregative rank index and the aggregative precedence relation between the alternatives are proposed.Stability analysis of the aggregative rank is performed.The sufficient conditions for the stability of the aggregative rank are then obtained.Finally,an illustrative example is(given.) |
| |
| Keywords: | alternative's aggregative rank stability precedence relation |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
