An extended Branch and Bound algorithm for bilevel multi-follower decision making in a referential-uncooperative situation

Research output: Contribution to journalArticlepeer-review

Authors

  • Jie Lu
  • Chenggen Shi
  • Guangquan Zhang
  • Da Ruan

Institutes & Expert groups

Documents & links

Abstract

Within the framework of any bilevel decision problem, a leader’s decision at the upper level is influenced by the reaction of their follower at the lower level. When multiple followers are involved in a bilevel decision problem, the leader’s decision will not only be affected by the reactions of those followers, but also by the relationships among those followers. One of the popular situations within this framework is where these followers are uncooperatively making decisions while having cross reference of decision information, called a referential-uncooperative situation in this paper. The well-known branch and bound algorithm has been successfully applied to a one-leader-and-one-follower linear bilevel decision problem. This paper extends this algorithm to deal with the abovementioned linear bilevel multi-follower decision problem by means of a linear eferentialuncooperative bilevel multi-follower decision model. It then proposes an extended branch and bound algorithm to solve this problem with a set of illustrative examples in a referential-uncooperative situation.

Details

Original languageEnglish
Pages (from-to)371-388
JournalInternational Journal of Information Technology & Decision Making
Volume6
Issue number2
DOIs
Publication statusPublished - Jun 2007

Keywords

  • Linear bilevel programming, branch and bound algorithm, optimization, multi-followers

ID: 89255