A λ-cut approximate algorithm for goal-based bilevel risk management systems

Publication Type:
Journal Article
International Journal of Information Technology and Decision Making, 2008, 7 (4), pp. 589 - 610
Issue Date:
Filename Description Size
Thumbnail2008000060OK.pdf537.19 kB
Adobe PDF
Full metadata record
Bilevel programming techniques are developed for decentralized decision problems with decision makers located in two levels. Both upper and lower decision makers, termed as leader and follower, try to optimize their own objectives in solution procedure but are affected by those of the other levels. When a bilevel decision model is built with fuzzy coefficients and the leader and/or follower have goals for their objectives, we call it fuzzy goal bilevel (FGBL) decision problem. This paper first proposes a λ-cut set based FGBL model. A programmable λ-cut approximate algorithm is then presented in detail. Based on this algorithm, a FGBL software system is developed to reach solutions for FGBL decision problems. Finally, two examples are given to illustrate the application of the proposed algorithm. © 2008 World Scientific Publishing Company.
Please use this identifier to cite or link to this item: