Abstract
A linear bilevel programming problem can be reformulated as a single level mathematical program with complementarity constraints, which in turn is equivalent to a mixed integer (0-1) linear programming problem. A binary differential evolution algorithm with a linear programming solver is developed to solve the mixed integer (0-1) linear programming problem. The computational results show the efficiency of the proposed algorithm.
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