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.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
Bard, J.F.: Practical Bilevel Optimization: Algorithms and Applications. Kluwer Academic, Dordrecht (1998)
Dempe, S.: Foundations of Bilevel Programming. Kluwer Academic, Dordrecht (2002)
Bard, J.F.: Optimality conditions for the bilevel programming problem. Nav. Res. Logist. Q. 31, 13–26 (1984)
Bard, J.F.: Some properties of the bilevel programming problem. J. Optim. Theory Appl. 68, 371–378 (1991)
Dempe, S.: A necessary and sufficient optimality condition for bilevel programming problem. Optimization 25, 341–354 (1992)
Dempe, S.: First order necessary optimality conditions for general bilevel programming problems. J. Optim. Theory Appl. 95, 735–739 (1997)
Outrata, J.V.: On necessary optimality conditions for Stackelberg problems. J. Optim. Theory Appl. 76, 306–320 (1993)
Ye, J.J., Ye, X.Y.: Necessary optimality conditions for optimization problems with variational inequality constraints. Math. Oper. Res. 22, 977–997 (1997)
Ye, J.J., Zhu, D.L.: Optimality conditions for bilevel programming problems. Optimization 33, 9–27 (1995)
Yezza, A.: First order necessary optimality conditions for general bilevel programming problems. J. Optim. Theory Appl. 89, 189–219 (1996)
Babahadda, H., Gadhi, N.: Necessary optimality conditions for bilevel optimization problems using convexificators. J. Glob. Optim. 34, 535–549 (2006)
Dempe, S., Dutta, J., Mordukhovich, B.S.: New necessary optimality conditions in optimistic bilevel programming. Optimization 56, 577–604 (2007)
Ye, J.J.: Nondifferentiable multiplier rules for optimization and bilevel optimization problems. SIAM J. Optim. 15, 252–274 (2004)
Ye, J.J.: Constraint qualifications and KKT conditions for bilevel programming problems. Math. Oper. Res. 31, 811–824 (2006)
Li, X.F., Zhang, J.Z.: Necessary optimality conditions in terms of convexificators in Lipschitz optimization. J. Optim. Theory Appl. 131, 429–452 (2006)
Abadie, J.M.: On the Kuhn–Tucker theorem. In: Abadie, J. (ed.) Nonlinear Programming, pp. 21–36. Wiley, New York (1967)
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)
Demyanov, V.F., Jeyakumar, V.: Hunting for a smaller convex subdifferential. J. Glob. Optim. 10, 305–326 (1997)
Jeyakumar, V., Luc, D.T.: Nonsmooth calculus, maximality and monotonicity of convexificators. J. Optim. Theory Appl. 101, 599–621 (1999)
Dutta, J., Chandra, S.: Convexifactors, generalized convexity and optimality conditions. J. Optim. Theory Appl. 113, 41–65 (2002)
Dutta, J., Chandra, S.: Convexifactors, generalized convexity and vector optimization. Optimization 53, 77–94 (2004)
Clarke, F.H.: Optimization and Nonsmooth Analysis. Wiley Interscience, New York (1983)
Mordukhovich, B.S.: Variational Analysis and Generalized Differentiation, I: Basic Theory Grundlehren Series (Fundamental Principles of Mathematical Sciences), vol. 330. Springer, Berlin (2006)
Mordukhovich, B.S., Nam, N.M.: Variational stability and marginal functions via generalized differentiation. Math. Oper. Res. 30, 800–816 (2005)
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)
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by Vladimir F. Dem’yanov.
Rights 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
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10957-011-9941-0
Keywords
- Bilevel programming problem
- Value function
- Convexifactor
- Constraint qualifications
- Optimality conditions