Summary
In this article we develop certain necessary optimality condition for bilevel programming problems with convex lower-level problem. The results are abstract in nature and depend on an important construction in nonsmooth analysis called the coderivative of a set-valued map.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
Key words
References
H. Babahadda and N. Gadhi: Necessary optimality conditions for bilevel optimization problems using convexificators, Technical Report, Department of Mathematics, Dhar El Mehrez, Sidi Mohamed Ben Abdellah University, Fes, Morocco, 2005.
B. Bank and J. Guddat and D. Klatte and B. Kummer and K. Tammer, Non-Linear Parametric Optimization, Akademie-Verlag, Berlin, 1982.
J. F. Bard, Optimality conditions for bilevel programming, Naval Research Logistics Quaterly, Vol 31, 1984, pp 13–26.
J. F. Bard, Convex two level optimization, Mathematical Programming, Vol 40, 1988, 15–27.
J. F. Bard, On some properties of bilevel programming, Journal of Optimization Theory and Applications, Vol 68, 1991, pp 371–378.
C. Berge, Espaces topologiques: Fonctions multivoques, (French) Collection Universitaire de Mathématiques, Vol. III Dunod, Paris, 1959. ( In English) Topological spaces: Including a treatment of multi-valued functions, vector spaces and convexity. Translated from the French original by E. M. Patterson. Reprint of the 1963 translation. Dover Publications, Inc., Mineola, NY, 1997.
G. Y. Chen and J. Jahn (eds.), Mathematical Methods of Operations Research Vol. 48, 1998.
F. H. Clarke, Yu. Ledyaev, R. Stern and P. Wolenski, Nonsmooth Analysis and Control Theory, Springer, 1998.
S. Dempe, Foundations of Bilevel Programming, Kluwer Academic Publishers, 2002.
S. Dempe, A necessary and sufficient optimality condition for bilevel prgramming problems, Optimization, Vol 25, 1992, pp 341–354.
A. L. Dontchev and R. T. Rockafellar, Ample paramerization of variational inclusions, SIAM Journal on Optimization, Vol 12, 2001, pp 170–187.
A.L. Dontchev and R. T. Rockafellar, Primal-dual solution perturbations in convex optimization, Set-Valued Analysis, Vol 9, 2001, pp 49–65.
M. Kojima, Strongly stable stationary solutions in nonlinear programs, In: S.M. Robinson (ed.): Analysis and Computation of Fixed Points, Academic Press, New York, 1980, pp. 93–138.
A. B. Levy and B.S. Mordukhovich, Coderivatives in parametric optimization, Mathematical Programming, Vol 99, 2004, pp 311–327.
P. Loridan and J. Morgan, Weak via strong Stackelberg problem: New Results. Journal of Global Optimization, Vol 8, 1996, pp 263–287.
J. A. Mirrlees, The theory of moral hazard and unobservable bevaviour: part I, Review of Economic Studies, Vol. 66, 1999, pp. 3–21.
B. S. Mordukhovich, Generalized differential calculus for nonsmooth and setvalued mappings, Journal of Mathematical Analysis and Applications, Vol 183, 1994, pp 250–288.
J. Outrata, A generalized mathematical program with equilibrium constraints, SIAM Journal on Control and Optimization, Vol 38, 2000, pp 1623–1638.
J.-S. Pang and M. Fukushima, Complementarity constraint qualifications and simplified B-stationarity conditions for mathematical programs with equilibrium constraints, Computational Optimization and Applications, Vol. 13, 1999, pp. 111–136.
D. Ralph and S. Dempe, Directional Derivatives of the Solution of a Parametric Nonlinear Program, Mathematical Programming, Vol. 70, 1995, pp. 159–172.
R. T. Rockafellar and R. J. B. Wets, Variational Analysis, Springer-Verlag, 1998 (Second corrected printing 2004).
H. Scheel and S. Scholtes, Mathematical programs with equilibrium constraints: stationarity, optimality, and sensitivity, Mathematics of Operations Research, Vol. 25, 2000, pp. 1–22.
J. J. Ye, Nondifferentiable multiplier rules for optimization and bilevel optimization problems, SIAM Journal on Optimization, Vol. 15, 2004, pp. 252–274.
J. J. Ye, Constraint qualifications and necessary optimality conditions for optimization problems with variational inequality constraints, SIAM Journal on Optimization, Vol 10, 2000, pp 943–962.
J. J. Ye, Optimality conditions for optimization problems with complementarity constraints, SIAM Journal on Optimization Vol9, 1999, pp 374–387.
J. J. Ye and X. Y. Ye, Necessary optimality conditions for optimization problems with variational inequality constraints, Mathematics of Operations Research, Vol 22, 1997, pp 977–997.
J. J. Ye and D. L. Zhu, Optimality conditions for bilevel programming problems, Optimization Vol 33, 1995, pp 9–27.
J. J. Ye and D.L. Zhu, A note on optimality conditions for bilevel programming, Optimization 39, 1997, pp 361–366.
J. J. Ye, D. L. Zhu and Q. Z. Zhu, Exact penalization and necessary optimality conditions for generalized bilevel programming problem, SIAM Journal on Optimization, Vol 4, 1994, pp 481–507.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer Science + Business Media, LLC
About this chapter
Cite this chapter
Dutta, J., Dempe, S. (2006). Bilevel programming with convex lower level problems. In: Dempe, S., Kalashnikov, V. (eds) Optimization with Multivalued Mappings. Springer Optimization and Its Applications, vol 2. Springer, Boston, MA . https://doi.org/10.1007/0-387-34221-4_3
Download citation
DOI: https://doi.org/10.1007/0-387-34221-4_3
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-34220-7
Online ISBN: 978-0-387-34221-4
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)