Encyclopedia of Operations Research and Management Science

2001 Edition
| Editors: Saul I. Gass, Carl M. Harris

BILEVEL LINEAR PROGRAMMING

  • Saul I. Gass
  • Carl M. Harris
Reference work entry
DOI: https://doi.org/10.1007/1-4020-0611-X_73
Bilevel linear programming (BLP) is a hierarchical, decentralized, multilevel mathematical programming problem in which the objective functions and constraints are linear. It can be stated in terms of upper and lower problems as follows:
This is a preview of subscription content, log in to check access.

References

  1. [1]
    Bard, J.F. (1984). “Optimality Conditions for the Bilevel Programming Problem,” Naval Research Logistics Quarterly, 31, 13–16.Google Scholar
  2. [2]
    Ben-Ayed, O. (1993). “Bilevel Linear Programming,” Computers & Operations Research, 20, 485–501.Google Scholar
  3. [3]
    Bialas, W.F. and Karwan, M.H. (1984). “Two-level Linear Programming,” Mgmt. Sci., 30, 1004–1020.Google Scholar

Copyright information

© Kluwer Academic Publishers 2001

Authors and Affiliations

  • Saul I. Gass
    • 1
  • Carl M. Harris
    • 2
  1. 1.Robert H. Smith School of BusinessUniversity of MarylandCollege PartUSA
  2. 2.School of Information Technology & EngineeringGeorge Mason UniversityFairfaxUSA