Skip to main content
SpringerLink
Log in

Bilevel Linear Programming: Complexity, Equivalence to Minmax, Concave Programs

  • Reference work entry
Encyclopedia of Optimization

Article Outline

Keywords

Related Optimization Problems

Complexity of the Linear BLPP Problem

See also

References

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 2,500.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 2,499.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

References

  1. Audet C, Hansen P, Jaumard B, Savard G (1996) On the linear maxmin and related programming problems. GERAD - École des Hautes Études Commerciales, Montreal, Working paper G-96–15

    Google Scholar 

  2. Bard JF (1991) Some properties of the bilevel programming problem. J Optim Th Appl 68(2):371–378

    Article  MathSciNet  MATH  Google Scholar 

  3. Bard JF, Falk JE (1982) An explicit solution to the multi-level programming problem. Comput Oper Res 9(1):77–100

    Article  MathSciNet  Google Scholar 

  4. Ben-Ayed O, Blair CE (1990) Computational difficulties of bilevel linear programming. Oper Res 38(1):556–560

    MathSciNet  MATH  Google Scholar 

  5. Garey MR, Johnson DS (1979) Computers and intractability: A guide to the theory of NP-completeness. Freeman, New York

    MATH  Google Scholar 

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

    MathSciNet  MATH  Google Scholar 

  7. Jeroslow RG (1985) The polynomial hierarchy and a simple model for competitive analysis. Math Program 32:146–164

    Article  MathSciNet  MATH  Google Scholar 

  8. Shimizu K, Ishizuka Y, Bard JF (1997) Nondifferentiable and two-level mathematical programming. Kluwer, Dordrecht

    MATH  Google Scholar 

  9. Simaan M (1977) Stackelberg optimization of two-level systems. IEEE Trans Syst, Man Cybern SMC-7(4):554–556

    MathSciNet  Google Scholar 

  10. White DJ, Anandalingam G (1993) A penalty function approach for solving bi-level linear programs. J Global Optim 3:397–419

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University Texas, Austin, USA

    Jonathan F. Bard

Authors
  1. Jonathan F. Bard
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Chemical Engineering, Princeton University, Princeton, NJ, 08544-5263, USA

    Christodoulos A. Floudas

  2. Center for Applied Optimization, Department of Industrial and Systems Engineering, University of Florida, Gainesville, FL, 32611-6595, USA

    Panos M. Pardalos

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag

About this entry

Cite this entry

Bard, J.F. (2008). Bilevel Linear Programming: Complexity, Equivalence to Minmax, Concave Programs . In: Floudas, C., Pardalos, P. (eds) Encyclopedia of Optimization. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-74759-0_37

Download citation

Publish with us

Policies and ethics

Search

Navigation