Linear Bilevel Programming: Discrete Variables

  • Jonathan F. Bard
Part of the Nonconvex Optimization and Its Applications book series (NOIA, volume 30)

Abstract

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.

Keywords

Feasible Solution Search Tree Discrete Variable Integer Variable Current Node 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media Dordrecht 1998

Authors and Affiliations

  • Jonathan F. Bard
    • 1
  1. 1.Graduate Program in Operations Research, Department of Mechanical EngineeringThe University of TexasAustinUSA

Personalised recommendations