Skip to main content
SpringerLink
Log in

Optimality Conditions for Optimistic Bilevel Programming Problem Using Convexifactors

  • Published:
Journal of Optimization Theory and Applications Aims and scope Submit manuscript

Abstract

In this article, we introduce two versions of nonsmooth extension of Abadie constraint qualification in terms of convexifactors and Clarke subdifferential and employ the weaker one to develop new necessary Karush–Kuhn–Tucker type optimality conditions for optimistic bilevel programming problem with convex lower-level problem, using an upper estimate of Clarke subdifferential of value function in variational analysis and the concept of convexifactor.

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. Bard, J.F.: Practical Bilevel Optimization: Algorithms and Applications. Kluwer Academic, Dordrecht (1998)

    MATH  Google Scholar 

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

    MATH  Google Scholar 

  3. Bard, J.F.: Optimality conditions for the bilevel programming problem. Nav. Res. Logist. Q. 31, 13–26 (1984)

    Article  MathSciNet  MATH  Google Scholar 

  4. Bard, J.F.: Some properties of the bilevel programming problem. J. Optim. Theory Appl. 68, 371–378 (1991)

    Article  MathSciNet  MATH  Google Scholar 

  5. Dempe, S.: A necessary and sufficient optimality condition for bilevel programming problem. Optimization 25, 341–354 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  6. Dempe, S.: First order necessary optimality conditions for general bilevel programming problems. J. Optim. Theory Appl. 95, 735–739 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  7. Outrata, J.V.: On necessary optimality conditions for Stackelberg problems. J. Optim. Theory Appl. 76, 306–320 (1993)

    Article  MathSciNet  Google Scholar 

  8. Ye, J.J., Ye, X.Y.: Necessary optimality conditions for optimization problems with variational inequality constraints. Math. Oper. Res. 22, 977–997 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  9. Ye, J.J., Zhu, D.L.: Optimality conditions for bilevel programming problems. Optimization 33, 9–27 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  10. Yezza, A.: First order necessary optimality conditions for general bilevel programming problems. J. Optim. Theory Appl. 89, 189–219 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  11. Babahadda, H., Gadhi, N.: Necessary optimality conditions for bilevel optimization problems using convexificators. J. Glob. Optim. 34, 535–549 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  12. Dempe, S., Dutta, J., Mordukhovich, B.S.: New necessary optimality conditions in optimistic bilevel programming. Optimization 56, 577–604 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  13. Ye, J.J.: Nondifferentiable multiplier rules for optimization and bilevel optimization problems. SIAM J. Optim. 15, 252–274 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  14. Ye, J.J.: Constraint qualifications and KKT conditions for bilevel programming problems. Math. Oper. Res. 31, 811–824 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  15. Li, X.F., Zhang, J.Z.: Necessary optimality conditions in terms of convexificators in Lipschitz optimization. J. Optim. Theory Appl. 131, 429–452 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  16. Abadie, J.M.: On the Kuhn–Tucker theorem. In: Abadie, J. (ed.) Nonlinear Programming, pp. 21–36. Wiley, New York (1967)

    Google Scholar 

  17. Demyanov, V.F.: Convexification and concavification of positively homogeneous function by the same family of linear functions. Report 3.208,802 Universita di Pisa (1994)

  18. Demyanov, V.F., Jeyakumar, V.: Hunting for a smaller convex subdifferential. J. Glob. Optim. 10, 305–326 (1997)

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  21. Dutta, J., Chandra, S.: Convexifactors, generalized convexity and vector optimization. Optimization 53, 77–94 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  22. Clarke, F.H.: Optimization and Nonsmooth Analysis. Wiley Interscience, New York (1983)

    MATH  Google Scholar 

  23. Mordukhovich, B.S.: Variational Analysis and Generalized Differentiation, I: Basic Theory Grundlehren Series (Fundamental Principles of Mathematical Sciences), vol. 330. Springer, Berlin (2006)

    Google Scholar 

  24. Mordukhovich, B.S., Nam, N.M.: Variational stability and marginal functions via generalized differentiation. Math. Oper. Res. 30, 800–816 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  25. Mordukhovich, B.S., Nam, N.M., Yen, N.D.: Subgradients of marginal functions in parametric mathematical programming. Math. Program., Ser. B 116, 369–396 (2009)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, University of Delhi, Delhi, 110007, India

    Bhawna Kohli

Authors
  1. Bhawna Kohli
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Bhawna Kohli.

Additional information

Communicated by Vladimir F. Dem’yanov.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kohli, B. Optimality Conditions for Optimistic Bilevel Programming Problem Using Convexifactors. J Optim Theory Appl 152, 632–651 (2012). https://doi.org/10.1007/s10957-011-9941-0

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10957-011-9941-0

Keywords

Mathematics Subject Classification (2000)

Search

Navigation