Discrete linear bilevel programming problem

  • L. Vicente
  • G. Savard
  • J. Judice
Contributed Papers


In this paper, we analyze some properties of the discrete linear bilevel program for different discretizations of the set of variables. We study the geometry of the feasible set and discuss the existence of an optimal solution. We also establish equivalences between different classes of discrete linear bilevel programs and particular linear multilevel programming problems. These equivalences are based on concave penalty functions and can be used to design penalty function methods for the solution of discrete linear bilevel programs.

Key Words

Linear bilevel programming integer linear programming exact penalty functions 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Vicente, L., andCalamai, P.,Bilevel and Multilevel Programming: A Bibliography Review, Journal of Global Optimization, Vol. 5, pp. 291–306, 1994.CrossRefGoogle Scholar
  2. 2.
    Bard, J., andMoore, J.,An Algorithm, for the Discrete Bilevel Programming Problem, Naval Research Logistics, Vol. 39, pp. 419–435, 1992.MathSciNetGoogle Scholar
  3. 3.
    Edmunds, T., andBard, J.,An Algorithm for the Mixed Integer Nonlinear Bilevel Programming Problem, Annals of Operations Research, Vol. 34, pp. 149–162, 1992.CrossRefGoogle Scholar
  4. 4.
    Bard, J., andMoore, J.,The Mixed Integer Linear Bilevel Programming Problem, Operations Research, Vol. 38, pp. 911–921, 1990.Google Scholar
  5. 5.
    Wen, U., andYang, Y.,Algorithms for Solving the Mixed Integer Two-Level Linear Programming Problem, Computers and Operations Research, Vol. 17, pp. 133–142, 1990.CrossRefGoogle Scholar
  6. 6.
    Kalantari, B., andRosen, J.,Penalty for the Zero-One Equivalent Problem, Mathematical Programming, Vol. 24, pp. 229–232, 1982.CrossRefGoogle Scholar
  7. 7.
    Edmunds, T., andBard, J.,Algorithms for Nonlinear Bilevel Mathematical Programming, IEEE Transactions on Systems, Man, and Cybernetics, Vol. 21, pp. 83–89, 1991.Google Scholar
  8. 8.
    Luenberger, D.,Linear and Nonlinear Programming, Addison-Wesley Publishing Company, Reading, Massachusetts, 1989.Google Scholar
  9. 9.
    Hansen, P., Jaumard, B., andSavard, G.,New Branching and Bounding Rules for Linear Bilevel Programming, SIAM Journal on Statistical and Scientific Computing, Vol. 13, pp. 1194–1217, 1992.CrossRefGoogle Scholar
  10. 10.
    Júdice, J., andFaustino, A.,A Sequential LCP Method for Bilevel Linear Programming, Annals of Operations Research, Vol. 34, pp. 89–106, 1992.CrossRefGoogle Scholar
  11. 11.
    Vicente, L., Savard, G., andJúdice, J.,Descent Approaches for Quadratic Bilevel Programming, Journal of Optimization Theory and Applications, Vol. 81, pp. 379–399, 1994.CrossRefGoogle Scholar

Copyright information

© Plenum Publishing Corporation 1996

Authors and Affiliations

  • L. Vicente
    • 1
  • G. Savard
    • 2
  • J. Judice
    • 1
  1. 1.Departamento de MatemáticaUniversidade de CoimbraCoimbraPortugal
  2. 2.Département de Mathématiques et Génie IndustrielEcole Polytechnique de MontrealMontrealCanada

Personalised recommendations