Skip to main content
SpringerLink
Log in

Comments on: Algorithms for linear programming with linear complementarity constraints

  • Discussion
  • Published:
TOP Aims and scope Submit manuscript

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

References

  • Bard JF, Moore J (1990) A branch and bound algorithm for the bilevel programming problem. SIAM J Sci Stat Comput 11:281–292

    Article  Google Scholar 

  • Dempe S (1987) A simple algorithm for the linear bilevel programming problem. Optimization 18:373–385

    Article  Google Scholar 

  • Dempe S, Dutta J (to appear) Is bilevel programming a special case of a mathematical program with complementarity constraints? Math Program

  • Deng X (1998) Complexity issues in bilevel linear programming. In: Migdalas A, Pardalos PM, Värbrand P (eds) Multilevel optimization: algorithms and applications. Kluwer, Dordrecht, pp 149–164

    Chapter  Google Scholar 

  • Hansen P, Jaumard B, Savard G (1992) New branch-and-bound rules for linear bilevel programming. SIAM J Sci Stat Comput 13:1194–1217

    Article  Google Scholar 

  • Horst R, Tuy H (1990) Global optimization: deterministic approaches. Springer, Berlin

    Google Scholar 

  • Meyer CA, Floudas CA (2005) Convex underestimation of twice continuously differentiable functions by piecewise quadratic perturbation: spline αBB underestimators. J Glob Optim 32:221–258

    Article  Google Scholar 

  • Scheel H, Scholtes S (2000) Mathematical programs with equilibrium constraints: stationarity, optimality, and sensitivity. Math Oper Res 25:1–22

    Article  Google Scholar 

  • Tuy H (1995) Dc optimization: theory, methods and algorithms. In: Horst R, Pardalos PM (eds) Handbook of global optimization. Kluwer Academic, Dordrecht, pp 149–216

    Google Scholar 

  • Vicente L, Savard G, Júdice J (1994) Descent approaches for quadratic bilevel programming. J Optim Theory Appl 81:379–399

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. TU Bergakademie Freiberg, Freiberg, Germany

    S. Dempe

Authors
  1. S. Dempe
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to S. Dempe.

Additional information

This comment refers to the invited paper available at doi:10.1007/s11750-011-0228-2.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Dempe, S. Comments on: Algorithms for linear programming with linear complementarity constraints. TOP 20, 28–29 (2012). https://doi.org/10.1007/s11750-011-0231-7

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11750-011-0231-7

Keywords

Search

Navigation