Abstract
In this paper we adapt the main results from Amahroq and Gadhi (J Glob Optim 21:435–443, 2001) for a general set-valued optimization problem to an optimistic bilevel programming problem as an optimization problem with implicitly given set-valued constraint. Since this constraint is assumed to be upper but not lower semicontinuous in the sense of Berge, we need to deal with a lower semicontinuous distance function to this mapping. In order to approximate the gradient of the distance function, we introduce a new concept for a directional convexificator. Some calculus rules for this new tool are adapted and several properties are characterized. The main result presents optimality conditions for an optimistic bilevel programming problem using a convexificator constructed with the aid of the directional convexificator.
Similar content being viewed by others
References
Alonso, M., Rodríguez-Marín, L.: Set-relations and optimality conditions in set-valued maps. Nonlinear Anal. 63, 1167–1179 (2005)
Amahroq, T., Gadhi, N.: On the regularity condition for vector programming problems. J. Glob. Optim. 21, 435–443 (2001)
Amahroq, T., Gadhi, N.: Second order optimality conditions for the extremal problem under inclusion constraints. J. Math. Anal. Appl. 285, 74–85 (2003)
Auslender, A.: Regularity theorems in sensitivity theory with nonsmooth data. In: Guddat, J., Jongen, H.T., Kummer, B., Nožička, F. (eds.) Parametric Optimization and Related Topics. Akademie Verlag, Berlin (1987)
Bank, B., Guddat, J., Klatte, D., Kummer, B., Tammer, K.: Non-linear Parametric Optimization. Akademie Verlag, Berlin (1982)
Barbu, V., Precupanu, T.: Convexity and Optimization in Banach Spaces. Springer, Dordrecht (2012)
Bard, J.F.: Practical Bilevel Optimization: Algorithms and Applications. Kluwer Academic Publishers, Dordrecht (1998)
Chandra, S., Dutta, J.: Convexificators, generalized convexity, and optimality conditions. J. Optim. Theory Appl. 113, 41–64 (2002)
Clarke, F.H.: Optimization and Nonsmooth Analysis. SIAM, Philadelphia (1990)
Dempe, S.: A necessary and a sufficient optimality condition for bilevel programming problems. Optimization 25, 341–354 (1992)
Dempe, S.: Foundations of Bilevel Programming. Kluwer Academic Publishers, Dordrecht (2002)
Dempe, S., Dutta, J.: Bilevel programming with convex lower level problems. In: Dempe, S., Kalashnikov, V. (eds.) Optimization with Multivalued Mappings: Theory, Applications, and Algorithms. Springer, New York (2006)
Dempe, S., Dutta, J., Mordukhovich, B.S.: New necessary optimality conditions in optimistic bilevel programming. Optimization 56, 577–604 (2007)
Dempe, S., Gadhi, N.: Necessary optimality conditions for bilevel set optimization problems. J. Glob. Optim. 39, 529–542 (2007)
Dempe, S., Kalashnikov, V. (eds.): Optimization with Multivalued Mappings: Theory, Applications, and Algorithms. Springer, LLC (2002)
Dempe, S., Zemkoho, A.B.: On the Karush–Kuhn–Tucker reformulation of the bilevel optimization problem. Nonlinear Anal. 75, 1202–1218 (2012)
Dempe, S., Zemkoho, A.B.: KKT reformulation and necessary conditions for optimality in nonsmooth bilevel optimization. Preprint 2013–02, Department of Mathematics and Computer Science, TU Bergakademie Freiberg (2013)
Dempe, S., Zemkoho, A.B.: The bilevel programming problem: reformulations, constraint qualifications and optimality conditions. Math. Program. Ser. A 138, 447–473 (2013)
Demyanov, V.F., Jeyakumar, V.: Hunting for a smaller convex subdifferential. J. Glob. Optim. 10, 305–326 (1997)
Denkowski, Z., Migórski, S., Papageorgiou, N.S.: An Introduction to Nonlinear Analysis: Theory. Kluwer Academic/Plenum Publishers, Dordrecht (2003)
Dhara, A., Dutta, J.: Optimality Conditions in Convex Optimization: A Finite Dimensional View. CRC Press, Boca Raton (2012)
Dien, P.H.: Locally Lipschitzian set-valued maps and general extremal problems with inclusion constraints. Acta Math. Vietnam. 1, 109–122 (1983)
Dien, P.H.: On the regularity condition for the extremal problem under locally Lipschitz inclusion constraints. Appl. Math. Optim. 13, 151–161 (1985)
Ekeland, I.: On the variational principle. J. Math. Anal. Appl. 47, 324–353 (1974)
Flegel, M.L.: Constraint qualifications and stationarity concepts for mathematical programs with equilibrium constraints. Ph.D. thesis, Universität Würzburg (2005)
Hiriart-Urruty, J.B.: What conditions are satisfied at points minimizing the maximum of a finite number of differentiable functions? In: Giannessi, F. (ed.) Nonsmooth Optimization: Methods and Applications, pp. 166–174. Gordon and Breach, Amsterdam (1992)
Jeyakumar, V., Luc, D.T.: Nonsmooth calculs, minimality, and monotonicity of convexificators. J. Optim. Theory Appl. 101, 599–621 (1999)
Jeyakumar, V., Luc, D.T.: Nonsmooth Vector Functions and Continuous Optimization. Springer, New York (2008)
Migdalas, A., Pardalos, P.M., Värbrand, P. (eds.): Multilevel Optimization: Algorithms and Applications. Kluwer Academic Publishers, Dordrecht (1998)
Mordukhovich, B.S., Shao, Y.: On nonconvex subdifferential calculus in Banach spaces. J. Convex Anal. 2, 211–228 (1995)
Outrata, J.V.: Necessary optimality conditions for Stackelberg problems. J. Optim. Theory Appl. 76, 305–320 (1993)
Outrata, J.V.: On optimization problems with variational inequality constraints. SIAM J. Optim. 4, 340–357 (1994)
Thibault, L.: On subdifferentials of optimal value functions. SIAM J. Control Optim. 29, 1019–1036 (1991)
Ye, J.J., Zhu, D.L.: Optimality conditions for bilevel programming problems. Optimization 33, 9–27 (1995)
Zhang, R.: Problems of hierarchical optimization in finite dimensions. SIAM J. Optim. 4, 521–536 (1994)
Author information
Authors and Affiliations
Corresponding author
Additional information
Dedicated to the memory of Vladimir F. Demyanov.
Rights and permissions
About this article
Cite this article
Dempe, S., Pilecka, M. Necessary optimality conditions for optimistic bilevel programming problems using set-valued programming. J Glob Optim 61, 769–788 (2015). https://doi.org/10.1007/s10898-014-0200-4
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10898-014-0200-4