%0 Journal Article
%T A Lagrange Relaxation Based Approach to  Solve a Discrete-Continous Bi-Level Model
%A Zaida E. Alarc¨®n-Bernal
%A Ricardo Aceves-Garc¨ªa
%J Open Journal of Optimization
%P 100-111
%@ 2325-7091
%D 2019
%I Scientific Research Publishing
%R 10.4236/ojop.2019.83009
%X 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.
%K Bi-Level Programming
%K Lagrange Relaxation
%K Discrete-Continous Linear Bilevel
%U http://www.scirp.org/journal/PaperInformation.aspx?PaperID=95334