Advertisement

Journal of Global Optimization

, Volume 38, Issue 4, pp 597–608 | Cite as

Model and extended Kuhn–Tucker approach for bilevel multi-follower decision making in a referential-uncooperative situation

  • Jie Lu
  • Chenggen Shi
  • Guangquan Zhang
  • Tharam Dillon
Original Article

Abstract

When multiple followers are involved in a bilevel decision problem, the leader’s decision will be affected, not only by the reactions of these followers, but also by the relationships among these followers. One of the popular situations within this bilevel multi-follower issue is where these followers are uncooperatively making their decisions while having cross reference to decision information of the other followers. This situation is called a referential-uncooperative situation in this paper. The well-known Kuhn–Tucker approach has been previously successfully applied to a one-leader-and-one-follower linear bilevel decision problem. This paper extends this approach to deal with the above-mentioned linear referential-uncooperative bilevel multi-follower decision problem. The paper first presents a decision model for this problem. It then proposes an extended Kuhn–Tucker approach to solve this problem. Finally, a numerical example illustrates the application of the extended Kuhn–Tucker approach.

Keywords

Bilevel programming Bilevel multi-follower decision Kuhn–Tucker approach Optimization 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Stackelberg H.V. (1952) The Theory of the Market Economy. Oxford University Press, OxfordGoogle Scholar
  2. 2.
    Bard J. (1998) Practical Bilevel Optimization: Algorithms and Applications. Kluwer Academic Publishers, BostonGoogle Scholar
  3. 3.
    Candler W., Townsley R. (1982) A linear twolevel programming problem. Comput. Oper. Res. 9, 59–76CrossRefGoogle Scholar
  4. 4.
    Bialas W., Karwan M. (1984) Two-level linear programming. Manage. Sci. 30, 1004–1020CrossRefGoogle Scholar
  5. 5.
    Bard J., Falk J. (1982) An explicit solution to the multilevel programming problem. Comput. Oper. Res. 9, 77–100CrossRefGoogle Scholar
  6. 6.
    Bialas, W., Karwan, M.: Multilevel linear programming. Technical Report 781, State University of New York at Buffalo, (1978)Google Scholar
  7. 7.
    Hansen P., Jaumard B., Savard G. (1992) New branchandbound rules for linear bilevel programming. SIAM J. Sci. Stat. Comput. 13: 1194–1217CrossRefGoogle Scholar
  8. 8.
    Bialas, W., Karwan, M., Shaw, J.: A Parametric Complementary Pivot Approach for Twolevel Linear Programming. Technical Report 802, State University of New York at Buffalo, (1980)Google Scholar
  9. 9.
    Aiyoshi E., Shimizu K. (1981) Hierarchical decentralized systems and its new solution by a barrier method. IEEE Trans. Sys. Man Cybernet. 11, 444–449CrossRefGoogle Scholar
  10. 10.
    White D., Anandalingam G. (1993) A penalty function approach for solving bilevel linear programs. J. Global Optim. 3, 397–419CrossRefGoogle Scholar
  11. 11.
    Scholtes S., Stöhr M. (1999) Exact penalization of mathematical programs with equilibrium costraints. SIAM J. Control Optim. 37, 617–652CrossRefGoogle Scholar
  12. 12.
    Marcotte P., Zhu D. (1996) Exact and inexact penalty methods for the generalized bilevel programming problem. Math. Program. 74, 142–157Google Scholar
  13. 13.
    Ye J.J., Zhu D.L. (1997) Exact penalization and necessary optimality conditions for generalized bilevel programming problems. SIAM J. Optim. 7, 481–507CrossRefGoogle Scholar
  14. 14.
    Migdalas A. (1995) Bilevel programming in traffic planning: models, methods and challenge. J. Global Optim. 7, 381–405CrossRefGoogle Scholar
  15. 15.
    Migdalas A., Pardalos P.M., Värbrand P. (1997) Multilevel Optimization-Algorithms and Application. Kluwer Academics, DordrechtGoogle Scholar
  16. 16.
    Marcotte P. (1986) Network design problem with congestion effects: a case of bilevel programming. Math. Program. 34, 142–162CrossRefGoogle Scholar
  17. 17.
    Shi C., Zhang G., Lu J. (2005) On the definition of linear bilevel programming solution. Appl. Math. Comput. 160, 169–176CrossRefGoogle Scholar
  18. 18.
    Shi C., Lu J., Zhang G. (2005) An extended Kth-best approach for linear bilevel programming. Appl. Math. Comput. 164, 843–855CrossRefGoogle Scholar
  19. 19.
    Shi C., Lu J., Zhang G. (2005) An extended Kuhn–Tucker approach for linear bilevel programming. Appl. Math. Comput. 162, 51–63CrossRefGoogle Scholar
  20. 20.
    Lu J., Shi C., Zhang G. (2006) On bilevel multi-follower decision making: general framework and solutions. Inform. Sci. 176, 1607–1627CrossRefGoogle Scholar
  21. 21.
    Shi C., Zhang G., Lu J. (2005) A Kth-best approach for linear bilevel multi-follower programming. J. Global Optim. 33, 563–578CrossRefGoogle Scholar
  22. 22.
    Ritzberger K. (2002) Foundations of non-cooperative game theory. Oxford University Press, OxfordGoogle Scholar

Copyright information

© Springer Science+Business Media, Inc. 2006

Authors and Affiliations

  • Jie Lu
    • 1
  • Chenggen Shi
    • 1
  • Guangquan Zhang
    • 1
  • Tharam Dillon
    • 1
  1. 1.Faculty of Information TechnologyUniversity of TechnologySydneyAustralia

Personalised recommendations