Abstract
In bilevel programming there are two decision makers, the leader and the follower, who act in a hierarchy. In this paper we deal with a bilevel problem where the follower maximizes a supermodular function. The payoff for the leader is given by the weighted set that is chosen by the follower. To increase his payoff the leader can increase the supermodular function of the follower by a modular one, thus influencing the follower’s decision, but he has to pay a penalty for this. We want to find an optimum strategy for the leader. This is a bilevel programming problem with continuous variables in the upper level and a parametric supermodular maximization problem in the lower level. We analyze the structure of the bilevel problem. This we use to provide an equivalent one-level combinatorial problem. Finally, we investigate the properties of the new problem.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Bard JF (1998) Practical bilevel optimization – algorithms and applications. Kluwer Academic, Dordrecht
Cook W, Cunningham W, Pulleyblank W, Schrijver A (1998) Combinatorial optimization. Wiley, New York
Dempe S (2002) Foundations of bilevel programming. Kluwer Academic, Dordrecht
Dempe S (2003) Annotated bibliography on bilevel programming and mathematical programs with equilibrium constraints. Optimization 52:333–359
Fanghänel D (2006a) Optimality criteria for bilevel programming problems using the radial subdifferential. In: Dempe S, Kalashnikov V (eds) Optimization with multivalued mappings: theory, application and algorithms. Springer, Berlin, pp 73–95
Fanghänel D (2006b) Zwei Ebenen Optimierung Mit Diskreter Unterer Ebene. Dissertation. TU Bergakademie Freiberg. Available via http://fridolin.tu-freiberg.de/dissliste.html
Fanghänel D, Dempe S (2009) Bilevel programming with discrete lower level. Optimization 58(8):1029–1047
Fanghänel D (2011) Optimality conditions for a bilevel matroid problem. J Comb Optim 22(4):594–608
Fanghänel D, Liers F (2010) A fast exact algorithm for the problem of optimum cooperation and the structure of its solutions. J Comb Optim 19(3):369–393
Fujishige S (2005) Submodular functions and optimization, 2nd edn. Annals of discrete mathematics, vol 58. Elsevier, Amsterdam
Girlich E, Kovalev M (1996) Classification of polyhedral matroids. Math Methods Oper Res 43:134–159
Gümüş ZH, Floudas CA (2005) Global optimization of mixed-integer bilevel programming problems. Comput Manag Sci 2:181–212
Hansen P, Jaumard B, Savard G (1992) New branch-and-bound rules for linear bilevel programming. SIAM J Sci Stat Comput 13(5):1194–1217
Heuberger C (2004) Inverse combinatorial optimization: a survey on problems, methods, and constraints. J Comb Optim 8:329–361
Köppe M, Queyranne M, Ryan CT (2010) Parametric integer programming algorithm for bilevel mixed integer programs. J Optim Theory Appl 146:137–150
McCormick ST (2005) Submodular function minimization. In: Aardal K et al. (eds) Discrete optimization: handbooks in operations research, vol 12. Elsevier, Amsterdam
Preissmann M, Sebő A (2009) Graphic submodular function minimization: a graphic approach and applications. In: Cook W et al. (eds) Research trends in combinatorial optimization. Springer, Berlin, pp 365–385
Schrijver A (2003) Combinatorial optimization: polyhedra and efficiency. Springer, Berlin
Vicente LN, Savard G, Judice JJ (1996) The discrete linear bilevel programming problem. J Optim Theory Appl 89:597–614
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Fanghänel, D. A bilevel programming problem with maximization of a supermodular function in the lower level. J Comb Optim 26, 568–584 (2013). https://doi.org/10.1007/s10878-012-9478-7
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10878-012-9478-7