Abstract
Several algorithms have been developed to solve the two-level linear programming problem during the past years. In this paper, we will formulate the mixed integer two-level linear programming problem and develop both the exact and heuristic solution procedures based on the branch-and-bound technique for solving the problem. Computational experience and comparisons will be presented. © 1990.