Skip to main content

Bilevel Programming: Applications

  • Reference work entry
Encyclopedia of Optimization

Bilevel programming (see Bilevel programming: Introduction, history and overview; Bilevel programming) is ideally suited to model situations where the decision maker does not have full control over all decision variables. Five such situations are described in this article.

EXAMPLE 1

The first example involves the improvement of a road network through either capacity expansion, traffic signals synchronization, vehicle guidance systems, etc. While management may be assumed to control the design variables, it can only affect indirectly the travel choices of the network users. Let x denote the design vector, y the flow vector, X the set of feasible design variables and c i (x, y) the travel delay along link i. One wishes to minimize over the set X the system travel cost ∑ i y i c i (x, y), where the vector y is required to be an equilibrium traffic assignment corresponding to the design vector x. Neglecting the latter equilibrium requirement could lead to suboptimal policies. However, as...

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 1,699.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Ackere, A. Van: ‘The principal/agent paradigm: its relevance to various functional fields’, Europ. J. Oper. Res.70 (1993), 83–103.

    MATH  Google Scholar 

  2. Haurie, A., Loulou, R., and Savard, G.: ‘A two player game model of power cogeneration in New England’, IEEE Trans. Autom. Control37 (1992), 1451–1456.

    MathSciNet  MATH  Google Scholar 

  3. Hobbs, B.F., and Nelson, S.K.: ‘A non-linear bilevel model for analysis of electric utility demand-side planning issues’, Ann. Oper. Res.34 (1992), 255–274.

    MathSciNet  MATH  Google Scholar 

  4. Labbé, M., Marcotte, P., and Savard, G.: ‘A bilevel model of taxation and its application to optimal highway pricing’, Managem. Sci.44 (1998), 1608–1622.

    MATH  Google Scholar 

  5. Marcotte, P.: ‘Network design with congestion effects: A case of bilevel programming’, Math. Program.34 (1986), 142–162.

    MathSciNet  MATH  Google Scholar 

  6. Migdalas, A., Pardalos, P.M., and Värbrand, P.: Multilevel optimization: Algorithms and applications, Kluwer Acad. Publ., 1998.

    Google Scholar 

  7. Sherali, H.D.: ‘A multiple leader Stackelberg model and analysis’, Oper. Res.32 (1984), 390–404.

    MathSciNet  MATH  Google Scholar 

  8. Sherali, H.D., Soyster, A.L., and Murphy, F.H.: ‘Stackelberg-Nash-Cournot equilibria: characterizations and computations’, Oper. Res.31 (1983), 253–276.

    MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Kluwer Academic Publishers

About this entry

Cite this entry

Marcotte, P., Savard, G. (2001). Bilevel Programming: Applications . In: Floudas, C.A., Pardalos, P.M. (eds) Encyclopedia of Optimization. Springer, Boston, MA. https://doi.org/10.1007/0-306-48332-7_33

Download citation

  • DOI: https://doi.org/10.1007/0-306-48332-7_33

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-0-7923-6932-5

  • Online ISBN: 978-0-306-48332-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics