General Bilevel Programming

  • Jonathan F. Bard
Part of the Nonconvex Optimization and Its Applications book series (NOIA, volume 30)


Of the various types of mathematical two—level structures, the general bilevel programming problem is the most challenging. It was originally proposed as a model for a leader—follower game in which two players try to minimize their individual objective functions F(x, y) and f(x, y), respectively, subject to a series of interdependent constraints [S12, S13, S16]. Once again, the underlying assumptions are that full information is available, at least to the leader, and that cooperation is prohibited. This precludes the use of correlated strategies and side payments.


Bilevel Program Bundle Method Live Node Inducible Region Steep Descent Direction 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media Dordrecht 1998

Authors and Affiliations

  • Jonathan F. Bard
    • 1
  1. 1.Graduate Program in Operations Research, Department of Mechanical EngineeringThe University of TexasAustinUSA

Personalised recommendations