Bilevel programming

Essays and Surveys in Global Optimization

Volumn , Issue , 2005, Pages 165-193

  Dempe, Stephan ^a  

^a TU BERGAKADEMIE FREIBERG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 70449634721     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1007/0-387-25570-2_6     Document Type: Chapter

References (51)

1. Anandalingam, G. and F'riesz, T. (eds.). (1992). Hierarchical Optimization. Annals of Operations Research, vol. 24
2. Anitescu, M. (2002). On solving mathematical programs with complementarity constraints as nonlinear programs. Technical Report No. ANLINCS-P864-1200, Department of Mathematics, University of Pittsburgh,.
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. Bard, J.F. (1998). Practical Bilevel Optimixation: Algorithms and Applications. Kluwer Academic Publishers, Dordrecht
5. Clarke, F.H. (1983). Optimixation and Nonsmooth Analysis. John Wiley & Sons, New York
6. Dempe, S. (1992). A necessary and a sufficient optimality condition for bilevel programming problems. Optimization, 25:341-354
7. Dempe, S. (2002). Foundations of Bilevel Programming. Kluwer Academic Publishers, Dordrecht
8. Dempe, S. (2003). Annotated bibliography on bilevel programming and mathematical programs with equilibrium constraints. Optimization, 52:333-359
9. Dempe, S. and Kalashnikov, V. (2002). Discrete bilevel programming: Application to a gas shipper's problem. Preprint No. 2002-02, TU Bergakademie Freiberg, Fakultat fiir Mathematik und Informatik
10. Dempe, S. and Pallaschke,D. (1997). Quasidifferentiability of optimal solutions in parametric nonlinear optimization. Optimixation, 40:l.-24
11. Deng, X. (1998). Complexity issues in bilevel linear programming. In: Multilevel Optimization: Algorithms and Applications (A. Migdalas, P.M. Pardalos, and P. Varbrand, eds.), pp. 149-164, Kluwer Academic Publishers, Dordrecht
12. Fiacco, A.V. (1983). Introduction to Sensitivity and Stability Analysis in Nonlinear Programming. Academic Press, New York
13. Flegel, M.L. and Kanzow, C. (2002). Optimality conditions for mathematical programs with equilibrium constraints: Fritz John and Abadie-Type approaches. Report, Universitat Wurzburg, Germany
14. Flegel, M.L. and Kanzow, C. (2003). A Fritz John approach to first order optimality conditions for mathematical programs with equilibrium constraints. Optimization, 52:277-286
15. Fletcher, R. and Leyffer, S. (2002). Numerical experience with solving MPECs as NLPs. Numerical Analysis Report NA/210, Department sf Mathematics, University of Dundee, UK.
16. Fletcher, R., Leyffer, S., Ralph, D., and Scholtes, S. (2002). Local Convergence of SQP Methods for Mathematical Programs with Equilibrium Constraints. Numerical Analysis Report NA/209, Department of Mathematics, University of Dundee, UK.
17. Fliege, J. and Vicente, L.N. (2003). A Bicriteria Approach to Bilevel Optimization, Technical Report, Fachbereich Mathematik, Universitat Dortmund, Germany
18. Frangioni, A.(1995). 'on a new class of bilevel programming problems and its use for reformulating mixed integer problems. European Journal of Operational Research, 82:615-646
19. Fukushima, M. and Pang, J.-S. (1999). Convergence of a smoothing continuation method for mathematical programs with complementarity constraints. In: Ill-posed Variational Problems and Regularization Techniques (M. Thera and R. Tichatschke, eds.). Lecture Notes in Economics and Mathematical Systems, No. 477, Springer-Verlag, Berlin
20. Fulop., J. (1993). On the Equivalence between a Linear Bilevel Programming Problem and Linear Optimization over the Efficient Set. Working Paper, No. WP 93-1, Laboratory of Operations Research and Decision Systems, Computer and Automation Institute, Hungarian Academy of Sciences
21. Geiger, C. and Kanzow, C. (2003). Theorie und Numerik restrzngierter Optimierungsaufgaben. Springer-Verlag, Berlin
22. Guddat, J., Guerra Vasquez, F., and Jongen, H.Th. (1990). Parametric Optimization: Singularities, Pathfollowing and Jumps. John Wiley & Sons, Chichester and B.G. Teubner, Stuttgart
23. 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
24. Harker, P.T. and Pang, J.-S. (1988). Existence of optimal solutions to mathematical programs with equilibrium constraints. Operations Research Letters, 7:61-64
25. Haurie, A., Savard, G., and White, D. (1990). A note on: An efficient point algorithm for a linear two-stage optimization problem. Operations Research, 38:553-555
26. Hirsch, M.W. (1994). Differential Topology. Springer-Verlag, Berlin
27. Klatte, D. and Kummer, B. (2002). Nonsmooth Equations in Optimixation; Regularity, Calculus, Methods and Applications. Kluwer Academic Publishers, Dordrecht
28. Kojima, M. (1980). Strongly stable stationary solutions in nonlinear programs. In: Analysis and Computation of Fixed Points (S.M. Robinson, ed.), pp. 93-138, Academic Press, New York
29. Lignola, M.B. and Morgan, J. (1997). Stability of regularized bilevel programming problems. Journal of Optimixation Theory and Applications, 93:575-596
30. Loridan, P. and Morgan, J. (1989). New results on approximate solutions in two-level optimization. Optimixation, 20:819-836
31. Loridan, P. and Morgan, J. (1996). Weak via strong Stackelberg problem: New results. Journal of Global Optimization, 8:263-287
32. Lucchetti, R., Mignanego, F., and Pieri, G. (1987). Existence theorem of equilibrium points in S tackelberg games with constraints. Optimixation, 18:857-866
33. Luo, Z.-Q., Pang, J.-S., and Ralph, D. (1996). Mathematical Programs with Equilibrium Constraints. Cambridge University Press, Cambridge
34. Macal, C.M. and Hurter, A.P. (1997). Dependence of bilevel mathematical programs on irrelevant constraints. Computers and Operations Research, 24:ll29-ll4O.
35. Marcotte, P. (1986). Network design problem with congestion effects: A case of bilevel programming. Mathematical Programming, 34:142-162
36. Marcotte, P. and Savard, G. (1991). A note on the Pareto optimality of solutions to the linear bilevel programming problem. Computers and Operations Research, 18:355-359
37. Multilevel optimization: Algorithms and applications. Nonconvex Optimixation and its Applications (Athanasios Migdalas, Panos M. Parda-10s and Peter Varbrand, eds.), vol. 20, Kluwer Academic Publishers, Dordrecht
38. Mikhalevich, V.S., Gupal, A.M., and Norkin, V.I. (1987). Methods of Nonconvex Optimixation. Nauka, Moscow (in Russian
39. Mirrlees, J.A. (1999). The theory of moral hazard and unobservable bevaviour: Part I. Review of Economic Studies, 66:3-21
40. Moore, J. and Bard, J.F. (1990). The mixed integer linear bilevel programming problem. Operations Research, 38:911-921
41. Muu, L.D. (2000). On the construction of initial polyhedral convex set for optimization problems over the efficient set and bilevel linear programs. Vietnam Journal of Mathematics, 28:177-182
42. Outrata, J., KoEvara, M., and Zowe, J. (1998). Nonsmooth Approach to Optimization Problems with Equilibrium Constraints. Kluwer Academic Publishers, Dordrecht
43. Pardalos, P.M., Siskos, U., and Zopounidis, C., eds. (1995). Advances in Multicriteria Analysis. Kluwer Academic Publishers, Dordrecht
44. Ralph, D. and Dempe, S. (1995). Directional derivatives of the solution of a parametric nonlinear program. Mathematical Programming, 70:159-172
45. Scheel, H. and Scholtes, S. (2000). Mathematical programs with equilibrium constraints: Stationarity, optimality, and sensitivity. Mathematics of Operations Research, 25:l.-22
46. Scholtes, S. and Stohr, M. (2001). How stringent is the linear independence assumption for mathematical programs with stationarity constraints? Mathematics of Operations Research, 262351-863
47. Schramm, H. (1989). Eine Kombznation von bundle-und trust-region- Verfahren xur Losung nichtdiflerenxierbarer Optimierungsprobleme, No. 30, Bayreuther Mathematische Schriften, Bayreuth
48. Shapiro, A. (1988).Sensitivity analysis of nonlinear programs and differentiability properties of metric projections. SIAM Journal Control Optimization, 26:628-645
49. Vicente, L.N.,Savard, G., and Judice, J.J. (1996). The discrete linear bilevel programming problem. Journal of Optimization Theory and Applications, 89:597-614
50. Vogel, S. (2002). Zwei-Ebenen-Optimierungsaufgaben mit nichtkonvexer Zielfunktion in der unteren Ebene: Pfadverfolgung und Spriinge. Ph. D thesis, Technische Universitat Bergakademie Freiberg
51. White, D.J. and Anandalingam, G. (1993). A penalty function approach for solving bi.-level linear programs. Journal of Global Optimization, 3:397-419