Solving the binary integer bi-level linear programming problem

UNCW Author/Contributor (non-UNCW co-authors, if there are any, appear on document)
Peter M. Hocking (Creator)
The University of North Carolina Wilmington (UNCW )
Web Site:
John Karlof

Abstract: This thesis will introduce a historical perspective of the development of work in the field of multi-level linear programming. It will then proceed to extend the theoretical work of the mixed integer bi-level linear programming problem to encompass the binary integer bi-level linear programming problem. An algorithm will be developed to solve this particular problem using a preference function to determine the choice of branching in a branch and bound tree. Computational results will be compiled and the implications discussed.

Additional Information

A Thesis Submitted to the University of North Carolina at Wilmington in Partial Ful llment Of the Requirements for the Degree of Master of Arts
Language: English
Date: 2009
Bilinear forms, Computational complexity, Linear programming, Programming (Mathematics)
Bilinear forms
Computational complexity
Linear programming
Programming (Mathematics)

Email this document to