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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Bard, J.F. (1998). Linear Bilevel Programming: Discrete Variables. In: Practical Bilevel Optimization. Nonconvex Optimization and Its Applications, vol 30. Springer, Boston, MA. https://doi.org/10.1007/978-1-4757-2836-1_6
Download citation
DOI: https://doi.org/10.1007/978-1-4757-2836-1_6
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4419-4807-6
Online ISBN: 978-1-4757-2836-1
eBook Packages: Springer Book Archive