| Summary: | We present an exact algorithm for mixed integer linear bilevel programming
under some simplifying. This research is begun by the definition of verbality of
algorithm, then gaven the overview of algorithm�s frameworks. In this algorithm
is given three outputs of mixed integer linear bilevel programming problems, there
are finite optimal, infeasible, and unbounded case. Then, we prove to terminate
correctly. In the last of this paper, we also give the solution of two example for
mixed integer linear bilevel programming problems using the algorithm.
|
|---|