Abstract
Bilevel programming problems are hierarchical optimization problems where an objective function is minimized over the graph of the solution set mapping of a parametric optimization problem. In this paper, a selective survey for this living research area is given. Focus is on main recent approaches to solve such problems, on optimality conditions as well as on essential features of this problem class.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Anandalingam, G. and Friesz, T. (eds.). (1992). Hierarchical Optimization. Annals of Operations Research, vol. 24.
Anitescu, M. (2002). On solving mathematical programs with complementarity constraints as nonlinear programs. Technical Report No. ANL/NCS-P864-1200, Department of Mathematics, University of Pittsburgh,.
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.
Bard, J.F. (1998). Practical Bilevel Optimization: Algorithms and Applications. Kluwer Academic Publishers, Dordrecht.
Clarke, F.H. (1983). Optimization and Nonsmooth Analysis. John Wiley & Sons, New York.
Dempe, S. (1992). A necessary and a sufficient optimality condition for bilevel programming problems. Optimization, 25:341–354.
Dempe, S. (2002). Foundations of Bilevel Programming. Kluwer Academic Publishers, Dordrecht.
Dempe, S. (2003). Annotated bibliography on bilevel programming and mathematical programs with equilibrium constraints. Optimization, 52:333–359.
Dempe, S. and Kalashnikov, V. (2002). Discrete bilevel programming: Application to a gas shipper's problem. Preprint No. 2002-02, TU Bergakademie Freiberg, Fakultdt für Mathematik und Informatik.
Dempe, S. and Pallaschke, D. (1997). Quasidifferentiability of optimal solutions in parametric nonlinear optimization. Optimization, 40:1–24.
Deng, X. (1998). Complexity issues in bilevel linear programming. In: Multilevel Optimization: Algorithms and Applications (A. Migdalas, P.M. Pardalos, and P. Värbrand, eds.), pp. 149–164, Kluwer Academic Publishers, Dordrecht.
Fiacco, A.V. (1983). Introduction to Sensitivity and Stability Analysis in Nonlinear Programming. Academic Press, New York.
Flegel, M.L. and Kanzow, C. (2002). Optimality conditions for mathematical programs with equilibrium constraints: Fritz John and Abadie-Type approaches. Report, Universität Würzburg, Germany.
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.
Fletcher, R. and Leyffer, S. (2002). Numerical experience with solving MPECs as NLPs. Numerical Analysis Report NA/210, Department of Mathematics, University of Dundee, UK.
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.
Fliege, J. and Vicente, L.N. (2003). A Bicriteria Approach to Bilevel Optimization, Technical Report, Fachbereich Mathematik, Universität Dortmund, Germany.
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.
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.
Fülöp., 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.
Geiger, C. and Kanzow, C. (2003). Theorie und Numerik restringierter Optimierungsaufgaben. Springer-Verlag, Berlin.
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.
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.
Harker, P.T. and Pang, J.-S. (1988). Existence of optimal solutions to mathematical programs with equilibrium constraints. Operations Research Letters, 7:61–64.
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.
Hirsch, M.W. (1994). Differential Topology. Springer-Verlag, Berlin.
Klatte, D. and Kummer, B. (2002). Nonsmooth Equations in Optimization; Regularity, Calculus, Methods and Applications. Kluwer Academic Publishers, Dordrecht.
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.
Lignola, M.B. and Morgan, J. (1997). Stability of regularized bilevel programming problems. Journal of Optimization Theory and Applications, 93:575–596.
Loridan, P, and Morgan, J. (1989). New results on approximate solutions in two-level optimization. Optimization, 20:819–836.
Loridan, P. and Morgan, J. (1996). Weak via strong Stackelberg problem: New results. Journal of Global Optimization, 8:263–287.
Lucchetti, R., Mignanego, F., and Pieri, G. (1987). Existence theorem of equilibrium points in Stackelberg games with constraints. Optimization, 18:857–866.
Luo, Z.-Q., Pang, J.-S., and Ralph, D. (1996). Mathematical Programs with Equilibrium Constraints. Cambridge University Press, Cambridge.
Macal, C.M. and Hurter, A.P. (1997). Dependence of bilevel mathematical programs on irrelevant constraints. Computers and Operations Research, 24:1129–1140.
Marcotte, P. (1986). Network design problem with congestion effects: A case of bilevel programming. Mathematical Programming, 34:142–162.
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.
Multilevel optimization: algorithms and applications. Nonconvex Optimization and its Applications (Athanasios Migdalas, Panos M. Pardalos and Peter Värbrand, eds.), vol. 20, Kluwer Academic Publishers, Dordrecht.
Mikhalevich, V.S., Gupal, A.M., and Norkin, V.I. (1987). Methods of Nonconvex Optimization. Nauka, Moscow (in Russian).
Mirrlees, J.A. (1999). The theory of moral hazard and unobservable bevaviour: Part I. Review of Economic Studies, 66:3–21.
Moore, J. and Bard, J.F. (1990). The mixed integer linear bilevel programming problem. Operations Research, 38:911–921.
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.
Outrata, J., Kočvara, M., and Zowe, J. (1998). Nonsmooth Approach to Optimization Problems with Equilibrium Constraints. Kluwer Academic Publishers, Dordrecht.
Pardalos, P.M., Siskos, Y., and Zopounidis, C., eds. (1995). Advances in Multicriteria Analysis. Kiuwer Academic Publishers, Dordrecht.
Ralph, D. and Dempe, S. (1995). Directional derivatives of the solution of a parametric nonlinear program. Mathematical Programming, 70:159–172.
Scheel, H. and Scholtes, S. (2000). Mathematical programs with equilibrium constraints: stationarity, optimality, and sensitivity. Mathematics of Operations Research, 25:1–22.
Scholtes, S. and Stöhr, M. (2001). How stringent is the linear independence assumption for mathematical programs with stationarity constraints? Mathematics of Operations Research, 26:851–863.
Schramm, H. (1989). Eine Kombination von bundle-und trust-region-Verfahren zur Lösung nichtdifferenzierbarer Optimierungsprobleme, No. 30, Bayreuther Mathematische Schriften, Bayreuth,.
Shapiro, A. (1988). Sensitivity analysis of nonlinear programs and differentiability properties of metric projections. SIAM Journal Control Optimization, 26:628–645.
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.
Vogel, S. (2002). Zwei-Ebenen-Optimierungsaufgaben mit nichtkonvexer Zielfunktion in der unteren Ebene: Pfadverfolgung und Sprünge. Ph.D thesis, Technische Universitit Bergakademie Freiberg.
White, D.J. and Anandalingam, G. (1993). A penalty function approach for solving bi-level linear programs. Journal of Global Optimization, 3:397–419.
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer Science+Business Media, Inc.
About this chapter
Cite this chapter
Dempe, S. (2005). Bilevel Programming. In: Audet, C., Hansen, P., Savard, G. (eds) Essays and Surveys in Global Optimization. Springer, Boston, MA. https://doi.org/10.1007/0-387-25570-2_6
Download citation
DOI: https://doi.org/10.1007/0-387-25570-2_6
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-25569-9
Online ISBN: 978-0-387-25570-5
eBook Packages: Business and EconomicsBusiness and Management (R0)