ALGORITMA EKSAK UNTUK PROGRAM BILEVEL LINEAR CAMPURAN DENGAN TIGA ASUMSI PENYEDERHANAAN; AN EXACT ALGORITHM FOR THE MIXED INTEGER LINEAR BILEVEL PROGRAMMING UNDER THREE SIMPLIFYING ASSUMPTIONS

SHERLY PERMATA, Irwan Endrayanto

2014 | Disertasi | PROGRAM STUDI S2 MATEMATIKA

We present an exact algorithm for mixed integer linear bilevel programming under some simplifying. This research is begun by definition of verbality of algorithm, then gaven the overview of algorithm's framework. 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.

Kata Kunci : MIXED INTEGER LINEAR BILEVEL PROGRAMMING, THREE SIMPLIFYING ASSUMPTIONS