Abstract
We consider discrete bilevel optimization problems where the follower solves an integer program with a fixed number of variables. Using recent results in parametric integer programming, we present polynomial time algorithms for pure and mixed integer bilevel problems. For the mixed integer case where the leader’s variables are continuous, our algorithm also detects whether the infimum cost fails to be attained, a difficulty that has been identified but not directly addressed in the literature. In this case, it yields a “better than fully polynomial time” approximation scheme with running time polynomial in the logarithm of the absolute precision. For the pure integer case where the leader’s variables are integer, and hence optimal solutions are guaranteed to exist, we present an algorithm which runs in polynomial time when the total number of variables is fixed.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
Labbe, M., Marcotte, P., Savard, G.: A bilevel model of taxation and its application to optimal highway pricing. Manag. Sci. 44(12), 1608–1622 (1998)
Cote, J.-P., Marcotte, P., Savard, G.: A bilevel modelling approach to pricing and fare optimization in the airline industry. J. Revenue Pricing Manag. 2(1), 23–47 (2003)
Fischer, K.: Sequential discrete p-facility models for competitive location planning. Ann. Oper. Res. 111, 253–270 (2004)
Marinakis, Y., Migdalas, A., Pardalos, P.M.: A new bilevel formulation for the vehicle routing problem and a solution method using a genetic algorithm. J. Glob. Optim. 38(4), 555–580 (2007)
Chinchuluun, A., Pardalos, P.M., Huang, H.X.: Multilevel (hierarchical) optimization: complexity issues, optimality conditions, algorithms. In: Advances in Applied Mathematics and Global Optimization in Honor of Gilbert Strang. Advances in Mechanics and Mathematics Series, vol. 17, pp. 197–222. Springer, Berlin (2009)
Colson, B., Marcotte, P., Savard, G.: An overview of bilevel optimization. Ann. Oper. Res. 153(1), 235–256 (2007)
Dempe, S.: Foundations of bilevel programming. Nonconvex Optimization and Its Applications, vol. 61. Kluwer, Dordrecht (2002)
Migdalas, A., Pardalos, P.M. (eds.): Hierarchical and bilevel programming [Special Issue]. J. Glob. Optim. 8(3), 209–322 (1996)
Al-Khayyal, F.A., Horst, R., Pardalos, P.M.: Global optimization of concave functions subject to quadratic constraints: an application in nonlinear bilevel programming. Ann. Oper. Res. 34(1), 125–147 (1992)
Migdalas, A., Pardalos, P.M.: Nonlinear bilevel problems with convex second level problem: Heuristics and descent methods. In: Du, D.Z., Zhang, X.S., Chuan, K. (eds.) Operations Research and Its Applications, pp. 194–204. World Publishing, Singapore (1995)
Dempe, S.: Discrete bilevel optimization problems. Preprint, can be accessed at http://citeseer.ist.psu.edu/dempe01discrete.html, October 2001
Dempe, S., Richter, K.: Bilevel programming with knapsack constraints. Cent. Eur. J. Oper. Res. 8, 93–107 (2000)
DeNegre, S.T., Ralphs, T.K.: A branch-and-cut algorithm for integer bilevel linear programs. Oper. Res. Cyber-Infrastruct. 65 (2008)
Gumus, Z.H., Floudas, C.A.: Global optimization of mixed-integer bilevel programming problems. Comput. Manag. Sci. 2(3), 181–212 (2005)
Vicente, L., Savard, G., Judice, J.: Discrete linear bilevel programming problem. J. Optim. Theory Appl. 89(3), 597–614 (1996)
Moore, J., Bard, J.: The mixed integer linear bilevel programming problem. Oper. Res. 38, 911–921 (1990)
Lenstra, Jr., H.W.: Integer programming with a fixed number of variables. Math. Oper. Res. 8(4), 538–548 (1983)
Deng, X.: Complexity issues in bilevel linear programming. In: Migdalas, A., Pardalos, P.M., Varbrand, V. (eds.) Multilevel Optimization: Algorithms and Applications. Nonconvex Optimization and Its Applications, vol. 20, pp. 149–164. Springer, Berlin (1998)
Eisenbrand, F., Shmonin, G.: Parametric integer programming in fixed dimension. Math. Oper. Res. 33(4), 839–850 (2008)
Kannan, R.: Lattice translates of a polytope and the Frobenius problem. Combinatorica 12(2), 161–177 (1992)
Köppe, M., Ryan, C.T., Queyranne, M.: Rational Generating Functions and Integer Programming Games (2008). Arxiv preprint arXiv:0809.0689
Kwek, S., Melhorn, K.: Optimal search for rationals. Inf. Process. Lett. 86(1), 23–26 (2003)
Schrijver, A.: Theory of Linear and Integer Programming. Wiley-Interscience Series in Discrete Mathematics and Optimization. Wiley, Chichester (1986)
Barvinok, A., Woods, K.M.: Short rational generating functions for lattice point problems. J. Am. Math. Soc. 16, 957–979 (2003)
Verdoolaege, S.: barvinok. Available from URL http://freshmeat.net/projects/barvinok/ (2006)
Köppe, M., Verdoolaege, S., Woods, K.M.: An implementation of the Barvinok-Woods integer projection algorithm. In: International Conference on Information Theory and Statistical Learning (June 2008) pp. 53–59 (2008)
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by P.M. Pardalos.
The research of the last two authors was supported in part by a Discovery Grant from the Natural Sciences and Engineering Research Council (NSERC) of Canada to the second author.
Rights and permissions
Open Access This is an open access article distributed under the terms of the Creative Commons Attribution Noncommercial License (https://creativecommons.org/licenses/by-nc/2.0), which permits any noncommercial use, distribution, and reproduction in any medium, provided the original author(s) and source are credited.
About this article
Cite this article
Köppe, M., Queyranne, M. & Ryan, C.T. Parametric Integer Programming Algorithm for Bilevel Mixed Integer Programs. J Optim Theory Appl 146, 137–150 (2010). https://doi.org/10.1007/s10957-010-9668-3
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10957-010-9668-3