Skip to main content
SpringerLink
Log in

Is bilevel programming a special case of a mathematical program with complementarity constraints?

  • Full Length Paper
  • Series A
  • Published:
Mathematical Programming Submit manuscript

Abstract

Bilevel programming problems are often reformulated using the Karush–Kuhn–Tucker conditions for the lower level problem resulting in a mathematical program with complementarity constraints(MPCC). Clearly, both problems are closely related. But the answer to the question posed is “No” even in the case when the lower level programming problem is a parametric convex optimization problem. This is not obvious and concerns local optimal solutions. We show that global optimal solutions of the MPCC correspond to global optimal solutions of the bilevel problem provided the lower-level problem satisfies the Slater’s constraint qualification. We also show by examples that this correspondence can fail if the Slater’s constraint qualification fails to hold at lower-level. When we consider the local solutions, the relationship between the bilevel problem and its corresponding MPCC is more complicated. We also demonstrate the issues relating to a local minimum through examples.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Anitescu M.: On using the elastic mode in nonlinear programming approaches to mathematical programs with complementarity constraints. SIAM J. Optim. 15, 1203–1236 (2006)

    Article  MathSciNet  Google Scholar 

  2. Bard J.F.: Practical Bilevel Optimization: Algorithms and Applications. Kluwer, Dordrecht (1998)

    MATH  Google Scholar 

  3. DeMiguel, A.-V., Friedlander, M.P., Nogales, F.J., Scholtes, S.: An interior-point method for MPECS based on strictly feasible relaxations. Technical report, Department of Decision Sciences, London Business School (2004)

  4. Dempe S.: Foundations of Bilevel Programming. Kluwer, Dordrecht (2002)

    MATH  Google Scholar 

  5. Dempe S.: Annotated bibliography on bilevel programming and mathematical programs with equilibrium constraints. Optimization 52, 333–359 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  6. Dempe, S., Kalashnikov, V. (eds): Optimization with Multivalued Mappings: Theory, Applications and Algorithms. Springer, Berlin (2006)

    Google Scholar 

  7. Fukushima, M., Pang, J.-S.: Convergence of a smoothing continuation method for mathematical programs with complementarity constraints Ill-posed Variational Problems and Regularization Techniques, no. 477, Springer, Berlin (1999)

  8. Gauvin J.: A necessary and sufficient regularity condition to have bounded multipliers in nonconvex programming. Math. Program. 12, 136–139 (1977)

    Article  MathSciNet  MATH  Google Scholar 

  9. Jongen H.Th., Weber G.-W.: Nonlinear optimization: characterization of structural optimization. J. Glob. Optim. 1, 47–64 (1991)

    Article  MathSciNet  MATH  Google Scholar 

  10. Kojima M.: Strongly stable stationary solutions in nonlinear programs. In: Robinson, S.M. (eds) Analysis and Computation of Fixed Points, pp. 93–138. Academic Press, New York (1980)

    Google Scholar 

  11. Luo Z.-Q., Pang J.-S., Ralph D.: Mathematical Programs with Equilibrium Constraints. Cambridge University Press, Cambridge (1996)

    Book  Google Scholar 

  12. Mersha, A.G.: Solution methods for bilevel programming problems. Ph.D. thesis, TU Bergakademie Freiberg (2008)

  13. Migdalas, A., Pardalos, P.M., Värbrand, P. (eds): Multilevel Optimization: Algorithms and Applications. Kluwer, Dordrecht (1998)

    MATH  Google Scholar 

  14. Mirrlees J.A.: The theory of moral hazard and unobservable bevaviour: part I. Rev. Econ. Stud. 66, 3–21 (1999)

    Article  MATH  Google Scholar 

  15. Outrata J.: On the numerical solution of a class of Stackelberg problems. ZOR Math. Methods Oper. Res. 34, 255–277 (1990)

    Article  MathSciNet  MATH  Google Scholar 

  16. Outrata J., Kočvara M., Zowe J.: Nonsmooth Approach to Optimization Problems with Equilibrium Constraints. Kluwer, Dordrecht (1998)

    MATH  Google Scholar 

  17. Robinson S.M.: Generalized equations and their solutions, part II: applications to nonlinear programming. Math. Program. Stud. 19, 200–221 (1982)

    MATH  Google Scholar 

  18. Scholtes S., Stöhr M.: How stringent is the linear independence assumption for mathematical programs with stationarity constraints?. Math. Oper. Res. 26, 851–863 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  19. Ye J.J., Zhu D.L.: Optimality conditions for bilevel programming problems. Optimization 33, 9–27 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  20. Ye J.J., Zhu D.L., Zhu Q.J.: Exact penalization and necessary optimality conditions for generalized bilevel programming problems. SIAM J. Optim. 7, 481–507 (1997)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Technical University Bergakademie Freiberg, Freiberg, Germany

    S. Dempe

  2. Indian Institute of Technology, Kanpur, India

    J. Dutta

Authors
  1. S. Dempe
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. J. Dutta
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to S. Dempe.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Dempe, S., Dutta, J. Is bilevel programming a special case of a mathematical program with complementarity constraints?. Math. Program. 131, 37–48 (2012). https://doi.org/10.1007/s10107-010-0342-1

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10107-010-0342-1

Keywords

Mathematics Subject Classification (2000)

Search

Navigation