Abstract
Abstract: In this paper, a salutation 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. Linearized taking advantage of the structure of the leading problem, an algorithm is solving two-dimensional bi-level linear programming problems, classification of constrains, algorithm removes all redundant constraints, cycling and solution of problem.
Full Text
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call