Skip to main content

Bilevel Programming: Implicit Function Approach

BP

  • Reference work entry

Article Outline

Keywords

Reformulation as a One-Level Problem

Properties of the Solution Function

Optimality Conditions

  Conditions Using the Directional Derivative of the Solution Function

  Conditions Using the Generalized Jacobian of the Solution Function

Solution Algorithms

  Descent Algorithms

  Bundle Algorithms

See also

References

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   2,500.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD   2,499.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

References

  1. Clarke FH (1983) Optimization and nonsmooth analysis. Wiley, New York

    MATH  Google Scholar 

  2. Dempe S (1992) A necessary and a sufficient optimality condition for bilevel programming problems. Optim 25:341–354

    Article  MathSciNet  MATH  Google Scholar 

  3. Dempe S (1993) Directional differentiability of optimal solutions under Slater's condition. Math Program 59:49–69

    Article  MathSciNet  Google Scholar 

  4. Dempe S (1997) An implicit function approach to bilevel programming problems. In: Migdalas A, Pardalos PM, Värbrand P (eds) Multilevel Optimization: Algorithms, Complexity and Applications. Kluwer, Dordrecht

    Google Scholar 

  5. Dempe S, Pallaschke D (1997) Quasidifferentiability of optimal solutions in parametric nonlinear optimization. Optim 40:1–24

    Article  MathSciNet  MATH  Google Scholar 

  6. Dempe S, Schmidt H (1996) On an algorithm solving two-level programming problems with nonunique lower level solutions. Comput Optim Appl 6:227–249

    MathSciNet  MATH  Google Scholar 

  7. Fiacco AV, McCormic GP (1968) Nonlinear programming: Sequential unconstrained minimization techniques. Wiley, New York

    MATH  Google Scholar 

  8. Gauvin J, Savard G (1994) The steepest descent direction for the nonlinear bilevel programming problem. Oper Res Lett 15:265–272

    Article  MathSciNet  MATH  Google Scholar 

  9. Gfrerer H (1987) Hölder continuity of solutions of perturbed optimization problems under Mangasarian-Fromowitz constraint qualification. In: Guddat J et al (eds) Parametric Optimization and Related Topics. Akad Verlag, Berlin, pp 113–127

    Google Scholar 

  10. Hager WW (1979) Lipschitz continuity for constrained processes. SIAM J Control Optim 17:321–328

    Article  MathSciNet  MATH  Google Scholar 

  11. Harker PT, Pang J-S (1988) Existence of optimal solutions to mathematical programs with equilibrium constraints. Oper Res Lett 7:61–64

    Article  MathSciNet  MATH  Google Scholar 

  12. Kiwiel KC (1985) Methods of descent for nondifferentiable optimization. Springer, Berlin

    MATH  Google Scholar 

  13. Kojima M (1980) Strongly stable stationary solutions in nonlinear programs. In: Robinson SM (ed) Analysis and Computation of Fixed Points. Acad Press, New York pp 93–138

    Google Scholar 

  14. Kummer B (1988) Newton's method for non-differentiable functions. Adv Math Optim, In: Math Res, vol 45. Akad Verlag, Berlin

    Google Scholar 

  15. Loridan P, Morgan J (1989) ϵ-regularized two-level optimization problems: Approximation and existence results. In: Optimization: Fifth French-German Conf (Varez), In: Lecture Notes Math, vol 1405. Springer, Berlin, pp 99–113

    Google Scholar 

  16. Lucchetti R, Mignanego F, Pieri G (1987) Existence theorem of equilibrium points in Stackelberg games with constraints. Optim 18:857–866

    Article  MathSciNet  MATH  Google Scholar 

  17. Luo Z-Q, Pang J-S, Ralph D (1996) Mathematical programs with equilibrium constraints. Cambridge Univ Press, Cambridge

    Google Scholar 

  18. Outrata J (1990) On the numerical solution of a class of Stackelberg problems. ZOR: Methods and Models of Oper Res 34:255–277

    Article  MathSciNet  MATH  Google Scholar 

  19. Outrata JV (1993) Necessary optimality conditions for Stackelberg problems. J Optim Th Appl 76:305–320

    Article  MathSciNet  MATH  Google Scholar 

  20. Outrata J, Zowe J (1995) A numerical approach to optimization problems with variational inequality constraints. Math Program 68:105–130

    MathSciNet  Google Scholar 

  21. Ralph D, Dempe S (1995) Directional derivatives of the solution of a parametric nonlinear program. Math Program 70:159–172

    MathSciNet  Google Scholar 

  22. Robinson SM (1982) Generalized equations and their solutions, Part II: Applications to nonlinear programming. Math Program Stud 19:200–221

    MATH  Google Scholar 

  23. Schramm H, Zowe J (1992) A version of the bundle idea for minimizing a nonsmooth function: conceptual idea, convergence analysis, numerical results. SIAM J Optim 2:121–152

    Article  MathSciNet  MATH  Google Scholar 

  24. Shapiro A (1988) Sensitivity analysis of nonlinear programs and differentiability properties of metric projections. SIAM J Control Optim 26:628–645

    Article  MathSciNet  MATH  Google Scholar 

  25. Vicente LN, Calamai PH (1994) Bilevel and multilevel programming: A bibliography review. J Global Optim 5(3)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag

About this entry

Cite this entry

Dempe, S. (2008). Bilevel Programming: Implicit Function Approach . In: Floudas, C., Pardalos, P. (eds) Encyclopedia of Optimization. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-74759-0_44

Download citation

Publish with us

Policies and ethics