Abstract
Given a mixed 0–1 linear program in n binary variables, we studied in Chapter 2 the construction of an n + 1 level hierarchy of polyhedral approximations that ranges from the usual continuous relaxation at level 0 to an explicit algebraic representation of the convex hull of feasible solutions at level-n. While exponential in both the number of variables and constraints, level-n was shown in the previous chapter to serve as a useful tool for promoting valid inequalities and facets via a projection operation onto the original variable space. In this chapter, we once again invoke the convex hull representation at level-n, this time to provide a direct linkage between discrete sets and their polyhedral relaxations. Specifically, we study conditions under which a binary variable realizing a value of either 0 or 1 in an optimal solution to the linear programming relaxation of a mixed 0–1 linear program will persist in maintaining that same value in some discrete optimum.
Keywords
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.
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
© 1999 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Sherali, H.D., Adams, W.P. (1999). Persistency in Discrete Optimization. In: A Reformulation-Linearization Technique for Solving Discrete and Continuous Nonconvex Problems. Nonconvex Optimization and Its Applications, vol 31. Springer, Boston, MA. https://doi.org/10.1007/978-1-4757-4388-3_6
Download citation
DOI: https://doi.org/10.1007/978-1-4757-4388-3_6
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4419-4808-3
Online ISBN: 978-1-4757-4388-3
eBook Packages: Springer Book Archive