Advertisement

Reduction of Dimension of the Upper Level Problem in a Bilevel Programming Model Part 2

  • Vyacheslav V. Kalashnikov
  • Stephan Dempe
  • Gerardo A. Pérez-Valdés
  • Nataliya I. Kalashnykova
Part of the Smart Innovation, Systems and Technologies book series (SIST, volume 10)

Abstract

The paper deals with a problem of reducing dimension of the upper level problem in a bilevel programming model. In order to diminish the number of variables governed by the leader at the upper level, we create the second follower supplied with the objective function coinciding with that of the leader and pass part of the uppser level variables to the lower level to be governed but the second follower. The lower level problem is also modified and becomes a Nash equilibrium problem solved by the original and the new followers. We look for conditions that guarantee that the modified and the original bilevel programming problems share at least one optimal solution.

Keywords

Nash Equilibrium Level Problem Bilevel Programming Lower Level Problem Bilevel Programming Problem 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Kalashnikov, V., Ríos-Mercado, R.: A natural gas cash-out problem: A bilevel programming framework and a penalty function method. Optimization and Engineering 7(4), 403–420 (2006)MathSciNetzbMATHCrossRefGoogle Scholar
  2. 2.
    Kalashnikov, V., Pérez-Valdés, G., Tomasgard, A., Kalashnykova, N.: Natural gas cash-out problem: Bilevel stochastic optimization approach. European Journal of Operational Research 206(1), 18–33 (2010)MathSciNetzbMATHCrossRefGoogle Scholar
  3. 3.
    Kinderlehrer, D., Stampacchia, G.: An Introduction to Variational Inequalities and Their Applications. Academic Press, New York (1980)zbMATHGoogle Scholar
  4. 4.
    Mangasarian, O.: Uniqueness of solution in linear programming. Linear Algebra and Its Applications 25, 151–162 (1979)MathSciNetzbMATHCrossRefGoogle Scholar
  5. 5.
    Rosen, J.: Existence and uniqueness of equilibrium points for concave N-person games. Econometrica 33(3), 520–534 (1965)MathSciNetzbMATHCrossRefGoogle Scholar
  6. 6.
    Nishimura, R., Hayashi, S., Fukushima, M.: Robust Nash equilibria in N-person non-cooperative games: Uniqueness and reformulation. Pacific Journal of Optimization 5(2), 237–259 (2005)MathSciNetGoogle Scholar
  7. 7.
    Saharidis, G., Ierapetritou, M.: Resolution method for mixed integer bilevel linear problems based on decomposition technique. Journal of Global Optimization 44(1), 29–51 (2009)MathSciNetzbMATHCrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Vyacheslav V. Kalashnikov
    • 1
  • Stephan Dempe
    • 2
  • Gerardo A. Pérez-Valdés
    • 3
  • Nataliya I. Kalashnykova
    • 4
  1. 1.ITESMMonterreyMexico
  2. 2.TU Bergacademie FreibergFreibergGermany
  3. 3.NTNUTrondheimNorway
  4. 4.UANLSan Nicolás de los GarzaMexico

Personalised recommendations