Article citationsMore>>

Tuy, H. and Ghannadan, S. (1998) A New Branch and Bound Method for Bilevel Linear Programs. In: Multilevel Optimization: Algorithms and Applications, Springer, Berlin, 231-249.
https://doi.org/10.1007/978-1-4613-0307-7_10

has been cited by the following article:

• TITLE: A Lagrange Relaxation Based Approach to Solve a Discrete-Continous Bi-Level Model

  AUTHORS: Zaida E. Alarcón-Bernal, Ricardo Aceves-García

  KEYWORDS: Bi-Level Programming, Lagrange Relaxation, Discrete-Continous Linear Bilevel

  JOURNAL NAME: Open Journal of Optimization, Vol.8 No.3, September 25, 2019

  ABSTRACT: In this work we propose a solution method based on Lagrange relaxation for discrete-continuous bi-level problems, with binary variables in the leading problem, considering the optimistic approach in bi-level programming. For the application of the method, the two-level problem is reformulated using the Karush-Kuhn-Tucker conditions. The resulting model is linearized taking advantage of the structure of the leading problem. Using a Lagrange relaxation algorithm, it is possible to find a global solution efficiently. The algorithm was tested to show how it performs.