Skip to main content
Log in

Optimality conditions for pessimistic bilevel problems using convexificator

  • Published:
Positivity Aims and scope Submit manuscript

A Correction to this article was published on 16 December 2023

This article has been updated

Abstract

The purpose of this paper is to study the pessimistic version of bilevel programming problems in finite-dimensional spaces. Problems of this type are intrinsically nonsmooth (even for smooth initial data). By using optimal value function, we transform the initial problem into a generalized minimax optimization problem. Using convexificators, first-order necessary optimality conditions are then established. An example that illustrates our findings is also given.

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

Access this article

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

Instant access to the full article PDF.

Similar content being viewed by others

Change history

References

  1. Bonnel, H., Morgan, J.: Optimality conditions for semivectorial bilevel convex optimal control problem. Springer Proc. Math. Stat. 50, 45–78 (2013)

    MathSciNet  Google Scholar 

  2. Clarke, F.C.: Optimization and Nonsmooth Analysis. Wiley, New York (1983)

    Google Scholar 

  3. Clarke, F.H.: Necessary conditions for a general control problem in calculus of variations and control. In: Russel, D. (ed.) Mathematics Research Center, Pub 36, pp. 259–278. University of Wisconsin, Wisconsin (1976)

    Google Scholar 

  4. Craven, B.D., Ralph, D., Glover, B.M.: Small convex-valued subdifferentials in mathematical programming. Optimization 32, 1–21 (1995)

    Article  MathSciNet  Google Scholar 

  5. Dempe, S.: Foundations of Bilevel Programming. Kluwer, Dordrecht (2002)

    Google Scholar 

  6. Dempe, S., Zemkoho, A.B.: The generalized Mangasarian–Fromowitz constraint qualification and optimality conditions for bilevel programs. J. Optim. Theory Appl. 148, 433–441 (2011)

    Article  MathSciNet  Google Scholar 

  7. Dempe, S., Mordukhovich, B.S., Zemkoho, A.B.: Necessary optimality conditions in pessimistic bilevel programming. Optimization 63, 505–533 (2014)

    Article  MathSciNet  Google Scholar 

  8. Dempe, S., Gadhi, N.: Necessary optimality conditions for bilevel set optimization problems. J. Global Optim. 39, 529–542 (2007)

    Article  MathSciNet  Google Scholar 

  9. Demyanov, V.F., Jeyakumar, V.: Huntting for a smaller convex subdifferential. J. Optim. Theory Appl. 10, 305–326 (1997)

    Google Scholar 

  10. Dutta, J., Chandra, S.: Convexificators, generalized convexity and optimality conditions. J. Optim. Theory Appl. 113, 41–65 (2002)

    Article  MathSciNet  Google Scholar 

  11. Jeyakumar, V., Luc, T.: Nonsmooth calculus, minimality and monotonicity of convexificators. J. Optim. Theory Appl. 101, 599–621 (1999)

    Article  MathSciNet  Google Scholar 

  12. Kohli, B.: Optimality conditions for optimistic bilevel programming problem using convexificators. J. Optim. Theory Appl. 152, 632–651 (2012)

    Article  MathSciNet  Google Scholar 

  13. Liu, B., Wan, Z., Chen, J., Wang, G.: Optimality conditions for pessimistic semivectorial bilevel programming problems. J. Inequal. Appl. 41, 1–26 (2014)

    MathSciNet  Google Scholar 

  14. Mordukhovich, B.S., Shao, Y.: A nonconvex subdifferential calculus in Banach space. J. Convex Anal. 2, 211–227 (1995)

    MathSciNet  Google Scholar 

  15. Mordukhovich, B.S.: Variational Analysis and Generalized Differentiation, I: Basic Theory, II: Applications. Springer, Berlin (2006)

    Google Scholar 

  16. Mordukhovich, B.S., Shao, Y.: Nonsmooth sequential analysis in Asplund spaces. Trans. Am. Math. Soc. 348, 1235–1280 (1996)

    Article  MathSciNet  Google Scholar 

  17. Mordukhovich, B.S., Nam, N.M., Phan, H.M.: Variational analysis of marginal functions with applications to bilevel programming problems. J. Optim. Theory Appl. 152, 557–586 (2012)

    Article  MathSciNet  Google Scholar 

  18. Nie, P.: A note on bilevel optimization problems. Int. J. Appl. Math. Sci. 2, 31–38 (2005)

    MathSciNet  Google Scholar 

  19. Penot, M.: A generalized derivatives for calm and stable functions. Diffe. Integr. Equ. 5, 433–454 (1992)

    MathSciNet  Google Scholar 

  20. Suneja, S.K., Kohli, B.: Optimality and duality results for bilevel programming problem using convexificators. J. Optim. Theory Appl. 150, 1–19 (2011)

    Article  MathSciNet  Google Scholar 

  21. Shimizu, K., Ishizuka, Y., Bard, J.F.: Nondifferentiable and Two-Level Mathematical Programming. Kluwer Academic Publishers, Dordrecht (1997)

    Book  Google Scholar 

  22. Thibault, L.: On subdifferentials of optimal value functions. SIAM J. Control Optim. 29, 1019–1036 (1991)

    Article  MathSciNet  Google Scholar 

  23. Treiman, J.S.: The linear nonconvex generalized gradient and Lagrange multipliers. SIAM J. Optim. 5, 670–680 (1995)

    Article  MathSciNet  Google Scholar 

  24. Ye, J.J., Zhu, D.L.: New necessary optimality conditions for bilevel programs by combining MPEC and the value function approach. SIAM J. Optim. 20, 1885–1905 (2010)

    Article  MathSciNet  Google Scholar 

Download references

Acknowledgements

Our sincere acknowledgements to the anonymous referees for their insightful remarks and suggestions. The second author has been supported by the Alexander-von Humboldt foundation.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to N. Gadhi.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Dempe, S., Gadhi, N. & Lafhim, L. Optimality conditions for pessimistic bilevel problems using convexificator. Positivity 24, 1399–1417 (2020). https://doi.org/10.1007/s11117-020-00737-x

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11117-020-00737-x

Keywords

Mathematics Subject Classification

Navigation