Granule sets based bilevel decision model
文献类型:期刊论文
作者 | Zheng, Zheng; He, Qing; Shi, Zhongzhi |
刊名 | ROUGH SETS AND KNOWLEDGE TECHNOLOGY, PROCEEDINGS
![]() |
出版日期 | 2006 |
卷号 | 4062页码:530-537 |
关键词 | bilevel decision granule set rough set tolerance granular space |
ISSN号 | 0302-9743 |
英文摘要 | Bilevel decision addresses the problem in which two levels of decision makers act and react in an uncooperative, sequential manner, and each tries to optimize their individual objectives under constraints. Such a bilevel optimization structure appears naturally in many aspects of planning, management and policy making. There are two kinds of bilevel decision models already presented, which are traditional bilevel decision models and rule sets based bilevel decision models. Based on the two kinds of models, granule sets based bilevel decision models are developed in this paper. The models can be viewed as extensions of the former two models, and they can describe more bilevel decision making problems and possess some new advantages. We also discuss the comparison of the three models and present some new topics in this research field. |
WOS研究方向 | Computer Science |
语种 | 英语 |
WOS记录号 | WOS:000239623500077 |
出版者 | SPRINGER-VERLAG BERLIN |
源URL | [http://119.78.100.204/handle/2XEOYT63/10606] ![]() |
专题 | 中国科学院计算技术研究所期刊论文_英文 |
通讯作者 | Zheng, Zheng |
作者单位 | 1.Chinese Acad Sci, Inst Comp Technol, Key Lab Intelligent Informat Proc, Beijing 100080, Peoples R China 2.Chinese Acad Sci, Grad Sch, Beijing 100039, Peoples R China |
推荐引用方式 GB/T 7714 | Zheng, Zheng,He, Qing,Shi, Zhongzhi. Granule sets based bilevel decision model[J]. ROUGH SETS AND KNOWLEDGE TECHNOLOGY, PROCEEDINGS,2006,4062:530-537. |
APA | Zheng, Zheng,He, Qing,&Shi, Zhongzhi.(2006).Granule sets based bilevel decision model.ROUGH SETS AND KNOWLEDGE TECHNOLOGY, PROCEEDINGS,4062,530-537. |
MLA | Zheng, Zheng,et al."Granule sets based bilevel decision model".ROUGH SETS AND KNOWLEDGE TECHNOLOGY, PROCEEDINGS 4062(2006):530-537. |
入库方式: OAI收割
来源:计算技术研究所
浏览0
下载0
收藏0
其他版本
除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。