Parametric integer programming algorithm for bilevel mixed integer programs

Journal of Optimization Theory and Applications

Volumn 146, Issue 1, 2010, Pages 137-150

  Koppe M ^a   Queyranne, M ^b,c   Ryan, C T ^c  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b UNIVERSITY OF CHILE   (Chile)

^c UNIVERSITY OF BRITISH COLUMBIA   (Canada)

Author keywords

Bilevel mixed integer linear programming; Binary search; Computational complexity; Parametric integer linear programming

Indexed keywords

COMPUTATIONAL COMPLEXITY; PARAMETER ESTIMATION; POLYNOMIAL APPROXIMATION;

BILEVEL; BILEVEL MIXED INTEGER LINEAR PROGRAMMING; BINARY SEARCH; INTEGER LINEAR PROGRAMMING; INTEGER PROGRAM- MING; MIXED INTEGER; MIXED INTEGER LINEAR; PARAMETRIC INTEGER LINEAR PROGRAMMING; PROGRAMMING ALGORITHMS;

INTEGER PROGRAMMING;

EID: 77953650842     PISSN: 00223239     EISSN: 15732878     Source Type: Journal    
DOI: 10.1007/s10957-010-9668-3     Document Type: Article

References (26)

1. 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).
2. 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).
3. Fischer, K.: Sequential discrete p-facility models for competitive location planning. Ann. Oper. Res. 111, 253-270 (2004).
4. 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).
5. 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).
6. Colson, B., Marcotte, P., Savard, G.: An overview of bilevel optimization. Ann. Oper. Res. 153(1), 235-256 (2007).
7. Dempe, S.: Foundations of bilevel programming. Nonconvex Optimization and Its Applications, vol. 61. Kluwer, Dordrecht (2002).
8. Migdalas, A., Pardalos, P. M. (eds.): Hierarchical and bilevel programming [Special Issue]. J. Glob. Optim. 8(3), 209-322 (1996).
9. 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).
10. 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).
11. Dempe, S.: Discrete bilevel optimization problems. Preprint, can be accessed at http://citeseer.ist.psu.edu/dempe01discrete.html, October 2001.
12. Dempe, S., Richter, K.: Bilevel programming with knapsack constraints. Cent. Eur. J. Oper. Res. 8, 93-107 (2000).
13. DeNegre, S. T., Ralphs, T. K.: A branch-and-cut algorithm for integer bilevel linear programs. Oper. Res. Cyber-Infrastruct. 65 (2008).
14. Gumus, Z. H., Floudas, C. A.: Global optimization of mixed-integer bilevel programming problems. Comput. Manag. Sci. 2(3), 181-212 (2005).
15. Vicente, L., Savard, G., Judice, J.: Discrete linear bilevel programming problem. J. Optim. Theory Appl. 89(3), 597-614 (1996).
16. Moore, J., Bard, J.: The mixed integer linear bilevel programming problem. Oper. Res. 38, 911-921 (1990).
17. Lenstra, Jr., H. W.: Integer programming with a fixed number of variables. Math. Oper. Res. 8(4), 538-548 (1983).
18. 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).
19. Eisenbrand, F., Shmonin, G.: Parametric integer programming in fixed dimension. Math. Oper. Res. 33(4), 839-850 (2008).
20. Kannan, R.: Lattice translates of a polytope and the Frobenius problem. Combinatorica 12(2), 161-177 (1992).
21. Köppe, M., Ryan, C. T., Queyranne, M.: Rational Generating Functions and Integer Programming Games (2008). Arxiv preprint arXiv: 0809. 0689.
22. Kwek, S., Melhorn, K.: Optimal search for rationals. Inf. Process. Lett. 86(1), 23-26 (2003).
23. Schrijver, A.: Theory of Linear and Integer Programming. Wiley-Interscience Series in Discrete Mathematics and Optimization. Wiley, Chichester (1986).
24. Barvinok, A., Woods, K. M.: Short rational generating functions for lattice point problems. J. Am. Math. Soc. 16, 957-979 (2003).
25. Verdoolaege, S.: barvinok. Available from URL http://freshmeat.net/projects/barvinok/ (2006).
26. 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).