Skip to main content
SpringerLink
Log in

Necessary Optimality Conditions for Bilevel Optimization Problems Using Convexificators

  • Published:
Journal of Global Optimization Aims and scope Submit manuscript

Abstract

In this work, we use a notion of convexificator (Jeyakumar, V. and Luc, D.T. (1999), Journal of Optimization Theory and Applicatons, 101, 599–621.) to establish necessary optimality conditions for bilevel optimization problems. For this end, we introduce an appropriate regularity condition to help us discern the Lagrange–Kuhn–Tucker multipliers.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. K. Allali T. Amahroq (1997) ArticleTitleSecond order approximations and primal and dual necessary optimality conditions Optimization 3 229–246

    Google Scholar 

  2. T. Amahroq N. Gadhi (2001) ArticleTitleOn the regularity condition for vector programming problems Journal of Global Optimization 21 435–443 Occurrence Handle10.1023/A:1012748412618

    Article  Google Scholar 

  3. J.F. Bard (1991) ArticleTitleSome properities of the bilevel programming problem Journal of optimization theory and applications 68 371–378 Occurrence Handle10.1007/BF00941574

    Article  Google Scholar 

  4. Clarke F.H. (1983). Optimization and Nonsmooth Analysis. Wiley-Interscience.

  5. F.H. Clarke (1976) Necessary conditions for a general control problem in calculus of variations and control D. Russel (Eds) Mathematics Research Center.Pub. 36 University of Wisconsin New York academy 259–278

    Google Scholar 

  6. Chen Y., Florian M. (1992), On the geometry structure of Linear Bilevel Programs: A dual approach, technical Report CRT-867, Centre de Recherche sur les transports, Université de Montreal, Montreal, Quebec, Canada.

  7. B.D. Craven D. Ralph B.M. Glover (1995) ArticleTitleSmall convex-valued subdifferentials in mathematical programming Optimization 32 1–21

    Google Scholar 

  8. S. Dempe (1992) ArticleTitleA necessary and a sufficient optimality condition for bilevel programming problem Optimization 25 341–354

    Google Scholar 

  9. S. Dempe (1997) ArticleTitleFirst-order necessary optimality conditions for general bilevel programming problems Journal Of Optimization Theory and Applications 95 735–739 Occurrence Handle10.1023/A:1022646611097

    Article  Google Scholar 

  10. V.F. Demyanov V. Jeyakumar (1997) ArticleTitleHunting for a smaller convex subdifferential Journal of Global Optimization 10 305–326 Occurrence Handle10.1023/A:1008246130864

    Article  Google Scholar 

  11. P.H. Dien (1983) ArticleTitleLocally Lipschitzian set-valued maps and general extremal problems with inclusion constraints Acta Math Vietnamica 1 109–122

    Google Scholar 

  12. I. Ekeland (1974) ArticleTitleOn the variational principle Journal of Mathematical Analysis and Application 47 324–353 Occurrence Handle10.1016/0022-247X(74)90025-0

    Article  Google Scholar 

  13. H.X. Huang P.M. Pardalos (2002) ArticleTitleA multivariate partition approach to optimization problems Cybernetics and Systems Analysis 38 IssueID2 265–275 Occurrence Handle10.1023/A:1016351614255

    Article  Google Scholar 

  14. A.D. Ioffe (1989) ArticleTitleApproximate subdifferential and applications. III: The metric theory Mathematika 36 1–38 Occurrence Handle10.1112/S0025579300013541

    Article  Google Scholar 

  15. V. Jeyakumar D.T. Luc (1998) ArticleTitleApproximate Jacobian matrices for continuous maps and C1-Optimization SIAM Journal on Control and Optimization 36 1815–1832 Occurrence Handle10.1137/S0363012996311745

    Article  Google Scholar 

  16. V. Jeyakumar D.T. Luc S. Schaible (1998) ArticleTitleCharacterizations of generalized monotone nonsmooth continuous maps using approximate Jacobians Journal of Convex Analysis 5 119–132

    Google Scholar 

  17. V. Jeyakumar D.T. Luc (1999) ArticleTitleNonsmooth calculus, minimality, and monotonicity of convexificators Journal of Optimization Theory and Applications 101 599–621 Occurrence Handle10.1023/A:1021790120780

    Article  Google Scholar 

  18. A. Jourani L. Thibault (1988) ArticleTitleApproximations and metric regularity in mathematical programming in Banach spaces Mathematics of Operations Research 18 73–96

    Google Scholar 

  19. P.D. Loewen (1992) ArticleTitleLimits of Frechet normals in nonsmouth analysis Optimization and Nonlinear Analysis, Pitman Research Notes Math, Ser. 244 178–188

    Google Scholar 

  20. B. Luderer (1983) Über der Äquivalenz nichtlinearer Optimierungsaufgaben, Technical Report Technische Universität Karl-Marx-Stadt Germany

    Google Scholar 

  21. Michel P. and Penot J.-P. (1984), Calcul sous-differentiel pour des fonctions Lipschitziennes et non Lipschitziennes C.R. Acad. Sc. Paris 298.

  22. P. Michel J.-P. Penot (1992) ArticleTitleA generalized derivative for calm and stable functions Differential and Integral Equations 5 IssueID2 433–454

    Google Scholar 

  23. Migdalas A., Pardalos P.M., Varbrand P. (1997), Multilevel Optimization: Algorithms and Applications. Kluwer Academic Publishers.

  24. B.S. Mordukhovich Y. Shao (1995) ArticleTitleOn nonconvex subdifferential calculus in Banach spaces Journal of Convex Analysis 2 211–228

    Google Scholar 

  25. J.V. Outrata (1993) ArticleTitleOn necessary optimality conditions for stackelberg problems Journal of Optimiztion Theory and Applications 76 306–320

    Google Scholar 

  26. J.V. Outrata (1993) ArticleTitleOptimality problems with variational inequality constraints SIAM Journal on Optimization 4 340–357 Occurrence Handle10.1137/0804019

    Article  Google Scholar 

  27. J.P. Penot (1988) ArticleTitleOn the mean-value theorem Optimization 19 147–156

    Google Scholar 

  28. L. Thibault (1991) ArticleTitleOn subdifferentials of optimal value functions SIAM Journal of Control and Optimization 29 1019–1036 Occurrence Handle10.1137/0329056

    Article  Google Scholar 

  29. J.S. Treiman (1995) ArticleTitleThe linear nonconvex generalized gradient and Lagrange multipliers SIAM Journal on Optimization 5 670–680 Occurrence Handle10.1137/0805033

    Article  Google Scholar 

  30. S. Wang Q. Wang S. Romano-Rodriguez (1993) ArticleTitleOptimality conditions and an algorithm for linear-quadratic bilevel programs Optimization 4 521–536

    Google Scholar 

  31. J.J. Ye D.L. Zhu (1995) ArticleTitleOptimality conditions for bilevel programming problems Optimization 33 9–27

    Google Scholar 

  32. R. Zhang (1993) ArticleTitleProblems of hierarchical optimization in finite dimensions SIAM Journal On Optimization 4 521–536 Occurrence Handle10.1137/0804029

    Article  Google Scholar 

  33. J. Zowe S. Kurcyusz (1979) ArticleTitleRegularity and stability for the mathematical programming problem in Banach spaces Applied Mathematics and optimization 5 49–62 Occurrence Handle10.1007/BF01442543

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, Dhar El Mehrez, Sidi Mohamed Ben Abdellah University, Fes, Morocco

    H. Babahadda & N. Gadhi

Authors
  1. H. Babahadda
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. N. Gadhi
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to N. Gadhi.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Babahadda, H., Gadhi, N. Necessary Optimality Conditions for Bilevel Optimization Problems Using Convexificators. J Glob Optim 34, 535–549 (2006). https://doi.org/10.1007/s10898-005-1650-5

Download citation

  • Received:

  • Accepted:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10898-005-1650-5

Keywords

Mathematics Subject Classifications (1991).

Search

Navigation