Summary
Focus in the paper is on optimality conditions for bilevel programming problems. We start with a general condition using tangent cones of the feasible set of the bilevel programming problem to derive such conditions for the optimistic bilevel problem. More precise conditions are obtained if the tangent cone possesses an explicit description as it is possible in the case of linear lower level problems. If the optimal solution of the lower level problem is a PC 1-function, sufficient conditions for a global optimal solution of the optimistic bilevel problem can be formulated. In the second part of the paper relations of the bilevel programming problem to set-valued optimization problems and to mathematical programs with equilibrium constraints are given which can also be used to formulate optimality conditions for the original problem. Finally, a variational inequality approach is described which works well when the involved functions are monotone. It consists in a variational re-formulation of the optimality conditions and looking for a solution of the thus obtained variational inequality among the points satisfying the initial constraints. A penalty function technique is applied to get a sequence of approximate solutions converging to a solution of the original problem with monotone operators.
on leave from the Central Economics and Mathematics Institute (CEMI) of the Russian Academy of Sciences, Nakhimovsky prospect 47, Moscow 117418, Russian Federation
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
J.F. Bard (1998): Practical Bilevel Optimization: Algorithms and Applications, Dordrecht: Kluwer Academic Publishers.
G.Y. Chen and J. Jahn (eds.) (1998), Mathematical Methods of Operations Research, vol. 48.
G. Y. Chen and J. Jahn (1998). Optimality conditions for set-valued optimization problems. Mathematical Methods of Operations Research, 48: 187–200.
S. Dempe (1992). A necessary and a sufficient optimality condition for bilevel programming problems. Optimization, 25: 341–354.
S. Dempe (2002): Foundations of Bilevel Programming, Dordrecht: Kluwer Academic Publishers, 2002.
S. Dempe (2003). Annotated Bibliography on Bilevel Programming and Mathematical Programs with Equilibrium Constraints, Optimization, 52:, 333–359.
S. Dempe, J. Dutta, S. Lohse (2005) Optimality conditions for bilevel programming problems, Preprint, TU Bergakademie Freiberg.
S. Dempe, S. Lohse: Inverse linear programming, In: Recent Advances in Optimization. Proceedings of the 12th French-German-Spanish Conference on Optimization held in Avignon, September 20–24, 2004, Edited by A. Seeger. Lectures Notes in Economics and Mathematical Systems, Vol. 563, Springer-Verlag Berlin Heidelberg, 2006. pp. 19–28.
S. Dempe, T. Unger (1999). Generalized PC 1-functions, Optimization, 46:311–326.
V.F. Dem’yanov and A.M. Rubinov (1986): Quasidifferential Calculus, New York: Optimization Software.
A. Dontchev and R. T. Rockafellar (2001). Ample parametrization of variational inclusions, SIAM Journal on Optimization, 12: 170–187.
J. Dutta and S. Dempe (2004). Global minima of locally Lipschitz functions, KANGAL Research Report No. 2004/018, I.I.T. Kanpur, India, 2004.
J. Dutta, S. Dempe (2006). Bilevel programming with convex lower level problems, In: S. Dempe, V. Kalashnikov (eds.): Optimization with Multivalued Mappings: Theory, Applications and Algorithms, Springer Verlag, Berlin.
B.C. Eaves (1971). On the basic theorem of complementarity, Mathematical Programming, 1: 68–75.
D. Fanghänel (2006). Optimality criteria for bilevel programming problems using the radial subdifferential, In: S. Dempe, V. Kalashnikov (eds.): Optimization with Multivalued Mappings: Theory, Applications and Algorithms, Springer Verlag, Berlin.
M. L. Flegel and C. Kanzow (2003). A Fritz John approach to first order optimality conditions for mathematical programs with equilibrium constraints, Optimization, 52: 277–286.
M. L. Flegel and C. Kanzow. On the Guignard constraint qualification for mathematical programs with equilibrium constraints, Optimization, to appear.
M. L. Flegel and C. Kanzow. On M-stationarity for mathematical programs with equilibrium constraints, Journal of Mathematical Analysis and Applications, to appear.
M. L. Flegel and C. Kanzow (2005). Abadie-type constraint qualification for mathematical programs with equilibrium constraints, Journal of Optimization Theory and Applications, 124: 595–614.
P.T. Harker and S.-C. Choi (1991). A penalty function approach for mathematical programs with variational inequality constraints, Information and Decision Technologies, 17: 41–50.
P.T. Harker and J.-S. Pang (1988). Existence of optimal solutions to mathematical programs with equilibrium constraints, Operations Research Letters, 7: 61–64.
P.T. Harker and J.-S. Pang (1990). Finite-dimensional variational inequality and nonlinear complementarity problems: a survey of theory, algorithms and applications, Mathematical Programming, 48: 161–220.
J. Jahn (2000). Set-valued optimization: a survey, Preprint, Universität Erlangen-Nürnberg. Institut für Angewandte Mathematik.
G. Isac, V.A. Bulavsky and V.V. Kalashnikov (2002). Complementarity, Equilibrium, Efficiency and Economics, Kluwer Academic Publishers, Dordrecht/Boston/London, 468 p.
V.V. Kalashnikov and N.I. Kalashnikova (1996). Solving two-level variational inequality, Journal of Global Optimization, 8: 289–294.
S. Karamardian (1976). Complementarity over cones with monotone and pseudo-monotone maps, Journal of Optimization Theory and Applications, 18: 445–454.
S. Karamardian (1976). An existence theorem for the complementarity problem, Journal of Optimization Theory and Applications, 18: 455–464.
M. Kojima (1980). Strongly stable stationary solutions in nonlinear programs. In: S.M. Robinson (ed.): Analysis and Computation of Fixed Points, New York: Academic Press, pp. 93–138.
D. Klatte and B. Kummer (2002). Nonsmooth Equations in Optimization; Regularity, Calculus, Methods and Applications, Dordrecht: Kluwer Academic Publishers.
A. B. Levy and R. T. Rockafellar (1995). Sensitivity of solutions in nonlinear programming problems with nonunique multipliers. In: D.-Z. Du and L. Qi and R. S. Womersley (eds.): Recent Advances in Nonsmooth Optimization, World Scientific Publishing Co., Singapore et al., 215–223.
S. Lohse: Komplexitätsbeweis. Technical Report, TU Bergakademie Freiberg, 2005. see http://www.mathe.tu-freiberg.de/~lohses/Dateien/komplex.pdf
P. Loridan and J. Morgan (1996). Weak via strong Stackelberg problem: New results. Journal of Global Optimization, 8: 263–287.
R. Lucchetti and F. Mignanego and G. Pieri (1987). Existence theorem of equilibrium points in Stackelberg games with constraints. Optimization, 18: 857–866.
Z.-Q. Luo and J.-S. Pang and D. Ralph (1996). Mathematical Programs with Equilibrium Constraints. Cambridge University Press, Cambridge.
J. A. Mirrlees (1999). The theory of moral hazard and unobservable bevaviour: part I. Review of Economic Studies, 66: 3–21.
J.V. Outrata (1994). On optimization problems with variational inequality constraints, SIAM Journal on Optimization, 4: 340–357.
J. Outrata and M. Kočvara and J. Zowe (1998). Nonsmooth Approach to Optimization Problems with Equilibrium Constraints. Kluwer Academic Publishers, Dordrecht.
D. Ralph and S. Dempe (1995). Directional Derivatives of the Solution of a Parametric Nonlinear Program. Mathematical Programming, 70: 159–172.
R.T. Rockafellar (1970). Convex Analysis, Princeton University Press, Princeton, New Jersey.
H. Scheel and S. Scholtes (2000). Mathematical programs with equilibrium constraints: stationarity, optimality, and sensitivity. Mathematics of Operations Research, 25: 1–22.
M.J. Smith (1984). A descent algorithm for solving monotone variational inequalities and monotone complementarity problems, Journal of Optimization Theory and Applications, 44: 485–496.
H. Tuy (1998). Convex Analysis and Global Optimization. Kluwer Academic Publishers, Dordrecht.
J. J. Ye (2005). Necessary and sufficient optimality conditions for mathematical programs with equilibrium constraints, Journal of Mathematical Analysis and Applications, 307: 350–369.
R. Zhang (1994). Problems of hierarchical optimization in finite dimensions, SIAM Journal on Optimization, 4: 521–536.
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
Dempe, S., Kalashnikov, V.V., Kalashnykova, N. (2006). Optimality conditions for bilevel programming 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_1
Download citation
DOI: https://doi.org/10.1007/0-387-34221-4_1
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)