Bilevel programming: A combinatorial perspective

Graph Theory and Combinatorial Optimization

Volumn , Issue , 2005, Pages 191-217

  Marcotte, Patrice ^a   Savard, Gilles ^b  

^a UNIVERSITÉ DE MONTRÉAL   (Canada)

^b GERAD   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 27744608095     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1007/0-387-25592-3_7     Document Type: Chapter

References (39)

1. Alarie, S., Audet, C., Jaumard, B., and Savard, G. (2001). Concavity cuts for disjoint bilinear programming. Mathematical Programming, 90:373-398.
2. Audet, C. (1997). Optimisation globale structurke : proprikths, kquivalences et rksolution. Ph.D. thesis, c o l Peo lytechnique de Montrkal.
3. Audet, C., Hansen, P., Jaumard, B., and Savard, G. (1997). Links between linear bilevel and mixed 0-1 programming problems. Journal of Optimization Theory and Applications, 93:273-300.
4. Audet, C., Hansen, P., Jaumard, B., and Savard, G. (1999). A Symmetrical linear maxmin approach to disjoint bilinear programming. Mathematical Programming, 85:573-592.
5. Bard, J.F. (1998). Practical Bilevel Optimization-Algorithms and Applications. Kluwer Academic Publishers.
6. Beale, E. and Small, R. (1965). Mixed integer programming by a branch and bound technique. In: Proceedings of the 3rd IFIP Congress. pp. 450-451.
7. Candler, W. and Norton, R. (1977). Multilevel programing. Technical Report 20, World Bank Development Research Center, Washington, DC.
8. C6t6, J.-P., Marcotte, P., and Savard, G. (2003). A bilevel modeling approach to pricing and fare optimization in the airline industry. Journal of Revenue and Pricing Management, 2:23-36.
9. Dantzig, G., Fulkerson, D., and Johnson, S. (1954). Solution of a largescale traveling salesman problem. Operations Research, 2:393-410.
10. Dempe, S. (2002). Foundations of Bilevel Programming. Nonconvex Optimization and Its Applications, vol. 61. Kluwer Academic Publishers, Dordrecht, The Netherlands.
11. Desrochers, M. and Laporte, G. (1991). Improvements and extensions to the Miller-'Tucker-Zemlin subtour elimination constraints. Operations Research Letters, 10:27-36.
12. Flood, M. (1956). The traveling salesman problem. Operations Research, 4:61-75.
13. Fukushima, M. (1992). Equivalent differentiable optimization problems and descent methods for asymrnetric variational inequality problems. Mathematical Programming, 53:99-110.
14. Fukushima, M. and Pang, J. (1999). Complementarity constraint qualifications and simplified B-stationarity conditions for mathematical programs with equilibrium constraints. Computational Optimization and Applications, 13: 11 1-136.
15. Garey, M. and Johnson, D. (1979). Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman, New York.
16. Grigoriev, A., van Hoesel, S., van der Kraaij, A., Uetz, M., and Bouhtou, M. (2004). Pricing network edges to cross a river. Technical Report RM04009, Maastricht Economic Research School on Technology and Organisation, Maastricht, The Netherlands.
17. Hansen, P., Jaumard, B., and Savard, G. (1992). New branch-and-bound rules for linear bilevel programming. SIAM Journal on Scientific and Statistical Computing, 13:1194-1217.
18. Hogan, W. (1973). Point-to-set maps in mathematical programming. SIAM Review, 15:591-603.
19. Jeroslow, R. (1985). The polynomial hierarchy and a simple model for competitive analysis. Mathematical Programming, 32:146-164.
20. Konno, H. (1971). Bilinear Programming. 11. Applications of Bilinear Programming. Technical Report Technical Report No. 71-10, Operations Research House, Department of Operations Research, Stanford University, Stanford.
21. KoEvara, M. and Outrata, J. (1994). On optimization of systems governed by implicit complementarity problems. Numerical Functional Analysis and Optimization, 152369-887.
22. Labb6, M., Marcotte, P., and Savard, G. (1998). A bilevel model of taxation and its applications to optimal highway pricing. Management Science, 44:1608-1622.
23. Loridan, P. and Morgan, J. (1996). Weak via strong Stackelberg problem: New results. Journal of Global Optimization, 8:263-287.
24. Luo, Z., Pang, J., and Ralph, D. (1996). Mathematical Programs with Equilibrium Constraints. Cambridge University Press.
25. Marcotte, P., Savard, G., and Semet, F. (2003). A bilevel programming approach to the travelling salesman problem. Operations Research Letters, 32:240-248.
26. Marcotte, P., Savard, G., and Zhu, D. (2001). A trust region algorithm for nonlinear bilevel programming. Operations Research Letters, 29:171-179.
27. Mills, H. (1960). Equilibrium points in finite games. Journal of the Society for Industrial and Applied Mathematics, 8:397-402.
28. Nash, J. (1951). Noncooperative games. Annals of Mathematics, 14:286-295.
29. Pardalos, P. and Schnitger, G. (1988). Checking local optimality in constrained qu adratic programming is NP-hard. Operations Research Letters, 7:33-35.
30. Roch, S., Savard, G., and Marcotte, P. (2004). An Approximation Algorithm for Stackelberg Network Pricing.
31. Savard, G. (1989). Contribution d la programmation math6matique d deux niveaux. Ph.D. thesis, Ecole Polytechnique de Montrhal, Universit6 de Montrkal.
32. Scholtes, S. (2004). Nonconvex structures in nonlinear programming. Operations Research, 52:368-383.
33. Scholtes, S. and Stohr, M. (1999). Exact penalization of mathematical programs with equilibrium constraints. SIAM Journal on Control and Optimization, 37:(2):617-652.
34. Shimizu, K., Ishizuka, Y., and Bard, J. (1997). Nondiferentiable and Two-Level Mathematical Programming. Kluwer Academic Publishers.
35. Stackelberg, H. (1952). The Theory of Market Economy. Oxford University Press, Oxford.
36. TSPLIB. A library of traveling salesman problems. Available at http: //www . iwr .uni-heidelberg . de/groups/comopt/sof tware/ TSPLIB95.
37. van Hoesel, S., van der Kraaij, A., Mannino, C., Oriolo, G., and Bouhtou. M. (2003). Polynomial cases of the tarification problem. Technical Report RM03053, Maastricht Economic Research School on Technology and Organisation, Maastricht, The Netherlands.
38. Vicente, L., Savard, G., and Jtidice, J . (1994). Descent approaches for quadratic bilevel programming. Journal of Optimixation Theory and Applications, 81:379-399.
39. Vicente, L., Savard, G., and JidiceJ, . (1996). The discrete linear bilevel programming problem. Journal of Optimixation Theory and Applications, 89:597-614.