Summary
The discrete bilevel programming problems considered in this paper have discrete parametric lower level problems with linear constraints and a strongly convex objective function. Using both the optimistic and the pessimistic approach this problem is reduced to the minimization of auxiliary nondifferentiable and generally discontinuous functions. To develop necessary and sufficient optimality conditions for the bilevel problem the radial-directional derivative and the radial subdifferential of these auxiliary functions are used.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
J. F. Bard, Practical Bilevel Optimization: Algorithms and Applications, Kluwer Academic Publishers, Dordrecht, 1998
S. Dempe, Foundations of Bilevel Programming, Kluver Academic Publishers, Dordrecht, 2002
S. Dempe, Annotated Bibliography on Bilevel Programming and Mathematical Programs with Equilibrium Constraints, Optimization, 2003, Vol. 52, pp. 333–359
S. Dempe, V. Kalashnikov and Roger Z. RÃos-Mercado, Discrete Bilevel Programming: Application to a Natural Gas Cash-Out Problem, European Journal of Operational Research, 2005, Vol. 166, pp. 469–488
S. Dempe and K. Richter, Bilevel programming with knapsack constraints, Central European Journal of Operations Research, 2000, Vol. 8, pp. 93–107
S. Dempe, T. Unger, Generalized PC 1-Functions, Optimization, 1999, Vol. 46, pp. 311–326
V. F. Dem’yanov, A. N. Rubinov, Quasidifferential Calculus, Optimization Software, Publications Division, New York, 1986
T. Edmunds and J.F. Bard, An algorithm for the mixed-integer nonlinear bilevel programming problem, Annals of Operations Research, 1992, Vol. 34, pp. 149–162
R.-H. Jan and M.-S. Chern, Nonlinear integer bilevel programming, European Journal of Operational Research, 1994, Vol. 72, pp. 574–587
J.-P. Hiriart-Urruty and C. Lemarechal, Convex Analysis and Minimization Algorithms, Vol. 1, Springer-Verlag, Berlin et. al., 1993
P. Loridan and J. Morgan, On strict ɛ-solutions for a two-level optimization problem, In: W. Buhler et at. (eds.), Proceedings of the International Conference on Operations Research 90, Springer Verlag, Berlin, 1992, pp. 165–172
P. Loridan and J. Morgan, Weak via strong Stackelberg problem: New results, Journal of Global Optimization, 1996, Vol. 8, pp. 263–287
P. Recht, Generalized Derivatives: An Approach to a New Gradient in Nonsmooth Optimization, volume 136 of Mathematical Systems in Economics, Anton Hain, Frankfurt am Main, 1993
G. Savard and J. Gauvin, The steepest descent direction for the nonlinear bilevel programming problem, Operations Research Letters, 1994, Vol. 15, pp. 265–272
L. N. Vicente and G. Savard and J. J. Judice, The discrete linear bilevel programming problem, Journal of Optimization Theory and Applications, 1996, Vol. 89, pp. 597–614
U. Wen and Y. Yang, Algorithms for solving the mixed integer two-level linear programming problem, Computers and Operations Research, 1990, Vol. 17, pp. 133–142
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
Fanghänel, D. (2006). Optimality criteria for bilevel programming problems using the radial subdifferential. 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_4
Download citation
DOI: https://doi.org/10.1007/0-387-34221-4_4
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)