| Article ID: | iaor19891097 |
| Country: | United Kingdom |
| Volume: | 17 |
| Start Page Number: | 133 |
| End Page Number: | 142 |
| Publication Date: | Feb 1990 |
| Journal: | Computers and Operations Research |
| Authors: | Wen U.P., Yang Y.H. |
| Keywords: | heuristics, programming: branch and bound |
Several algorithms have been developed to solve the two-level linear programming problem during the past years. This paper formulates the mixed integer two-level linear programming problem and develops both the exact and heuristic solution procedures based on the branch-and-bound technique for solving the problem. Computational experience and comparisons are presented.