| Rule sets based bilevel decision model |
| Full text |
Pdf
(168 KB)
|
| Source
|
ACM International Conference Proceeding Series; Vol. 171
archive
Proceedings of the 29th Australasian Computer Science Conference - Volume 48
table of contents
Hobart, Australia
Pages: 113 - 120
Year of Publication: 2006
ISBN ~ ISSN:1445-1336 , 1-920682-30-9
|
|
Authors
|
|
Z. Zheng
|
Faculty of Information Technology, University of Technology, Sydney, Broadway, NSW, Australia and Key Laboratory of Intelligent Information Processing, Institute of Computing Technology, Chinese Academy of Sciences, Beijing, China
|
|
G. Zhang
|
Faculty of Information Technology, University of Technology, Sydney, Broadway, NSW, Australia
|
|
Q. He
|
Key Laboratory of Intelligent Information Processing, Institute of Computing Technology, Chinese Academy of Sciences, Beijing, China
|
|
J. Lu
|
Faculty of Information Technology, University of Technology, Sydney, Broadway, NSW, Australia
|
|
Z. Shi
|
Key Laboratory of Intelligent Information Processing, Institute of Computing Technology, Chinese Academy of Sciences, Beijing, China
|
|
| Publisher |
Australian Computer Society, Inc.
Darlinghurst, Australia, Australia
|
| Bibliometrics |
Downloads (6 Weeks): 2, Downloads (12 Months): 26, Citation Count: 0
|
|
|
ABSTRACT
Bilevel decision addresses the problem in which two levels of decision makers, each tries to optimize their individual objectives under constraints, act and react in an uncooperative, sequential manner. Such a bilevel optimization structure appears naturally in many aspects of planning, management and policy making. However, bilevel decision making may involve many uncertain factors in a real world problem. Therefore it is hard to determine the objective functions and constraints of the leader and the follower when build a bilevel decision model. To deal with this issue, this study explores the use of rule sets to format a bilevel decision problem by establishing a rule sets based model. After develop a method to construct a rule sets based bilevel model of a real-world problem, an example to illustrate the construction process is presented.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
1
|
Bard, J.F. (1998), Practical Bilevel Optimization: Algorithms and Applications, Kluwer Academic Publishers, USA.
|
| |
2
|
Bard, J.F. and Falk, J.E. (1982), An Explicit Solution to the Multi-Level Programming Problem, Computers & Operations Research 9, 77-100.
|
| |
3
|
Bard, J.F. and Moore, J.T. (1992), An Algorithm for the Discrete Bilevel Programming Problem, Naval Research Logistics 39, 419-435.
|
| |
4
|
Bialas, W. F. and Karwan, M. H. (1982), On Two-Level Optimization, IEEE Trans Automatic Control AC-26, 211-214.
|
| |
5
|
Bialas, W. and Karwan, M. (1984), Two-Level Linear Programming, Management Science 30, 1004-1020.
|
| |
6
|
Candler, W. and Norton, R. (1977), Multilevel Programming and Development Policy, World Band Staff Work No. 258, IBRD, Washington, D.C.
|
| |
7
|
Carlin, U. S., Komorowski, J. and Ohrn, A. (1998), Rough set analysis of patients with suspected of acute appendicitis, Proc. IPMU'98, Paris, France, 1528-1533.
|
| |
8
|
Chen, C.I. and Gruz, J.B. (1972), Stackelberg Solution for Two Person Games with Biased Informtaion Patterns, IEEE Trans. On Automatic Control AC-17, 791-798.
|
| |
9
|
Dempe, S. (2002), Foundations of Bilevel Programming, Kluwere Academic Publishers.
|
| |
10
|
Han, J. and Kamber, M. (2001), Data Mining Concepts and Techniques, Morgan Kaufmann Publishers.
|
| |
11
|
Hu, X.H. and Cercone, N. (1995), Learning in relational database: a rough set approach, Computational Intelligence, 11, 323-338.
|
| |
12
|
Kiak, A. (2001), Rough Set Theory: A Data Mining Tool For Semiconductor Manufacturing, IEEE Transaction on Electronics Packaging Manufacturing, 24, 44-50.
|
| |
13
|
|
| |
14
|
|
| |
15
|
Liang, L. and Sheng S.H. (1992), The Stability Analysis of Bilevel Decision and Its Application, Decision And Decision Support System 2, 63-70.
|
| |
16
|
|
| |
17
|
|
| |
18
|
|
 |
19
|
|
| |
20
|
ROSETTA: The ROSETTA Homepage, http://www.rosettaproject.org/.
|
| |
21
|
Schlimmer, J. C. and Fisher, D A. (1986), Case study of incremental concept induction, Proceedingsof the Fifth National Conf. on Artificial Intelligence, 1, 496-501.
|
| |
22
|
Shan, N., Ziarko, W., Hamilton, H. J., and Cercone, N. (1995), Using rough sets as tools for knowledge discovery, Proc. 1st Int. Conf. Knowledge Discovery Data Mining, Menlo Park, CA, 263-268.
|
| |
23
|
Shi, C., Lu, J. and Zhang, G. (2005a), An extended Kuhn-Tucker approach for linear bilevel programming, Applied Mathematics and Computation 162, 51-63.
|
| |
24
|
Shi, C., Lu, J. and Zhang, G. (2005b), An extended Kth-Best approach for linear bilevel programming, Applied Mathematics and Computation 164, 843-855.
|
| |
25
|
Shi, C., Zhang, G. and Lu, J. (2005), On the definition of linear bilevel programming solution, Applied Mathematics and Computation 160, 169-176.
|
| |
26
|
Stackelberg, H. V.(1952), The Theory of Market Economy, Oxford, Oxford University Press.
|
| |
27
|
Skowron, A. and Polkowski, L. (1998), Rough Sets in Knowledge Discovery, Physica Verlag, Heidelberg.
|
| |
28
|
Wang, G.Y. (2001), Rough set theory and knowledge acquisition, Press of Xi'an Jiaotong University (In Chinese).
|
| |
29
|
Wang, G. Y., Zheng, Z. and Zhang, Y. (2002), RIDAS-A Rough Set Based Intelligent Data Analysis System, Proceedings of the First International Conference on Machine Learning and Cybernetics, 646-649.
|
| |
30
|
White, D. and Anandalingam, G. (1993), A Penalty Function Approach For Solving Bi-Level Linear Programs, Journal of Global Optimization 3, 397-419.
|
| |
31
|
|
| |
32
|
|
|