Linear Bilevel Programming: Discrete Variables
In many optimization problems a subset of the variables is restricted to take on discrete values. This can complicate the problem by several orders of magnitude and render all but the smallest instances unsolvable. In this chapter, we investigate several versions of the linear BLPP with discrete variables and discuss the prospect of finding global optima using branch and bound.
KeywordsFeasible Solution Search Tree Discrete Variable Integer Variable Current Node
Unable to display preview. Download preview PDF.