Synopsis
Domain reduction is the process of eliminating regions from the feasible space if the removal does not affect the convergence of the search process to a global optimum. Domain reduction is also referred to as bounds tightening, domain contraction, and range reduction. Various techniques for domain reduction have been developed by Mangasarian & McLinden (1985), Thakur (1990), Hansen, Jaumard & Lu (1991), Hamed & McCormick (1993), Lamar (1993), Savelsbergh (1994), Andersen & Andersen (1995), Ryoo & Sahinidis (1995), Ryoo & Sahinidis (1996), Shectman & Sahinidis (1998), Zamora & Grossmann (1999). We develop a theory of domain reduction in this chapter and then derive earlier results in the light of these new developments. For example, our results generalize to the nonlinear case, range reduction tests used in the integer linear programming literature.
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
© 2002 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Tawarmalani, M., Sahinidis, N.V. (2002). Domain Reduction. In: Convexification and Global Optimization in Continuous and Mixed-Integer Nonlinear Programming. Nonconvex Optimization and Its Applications, vol 65. Springer, Boston, MA. https://doi.org/10.1007/978-1-4757-3532-1_5
Download citation
DOI: https://doi.org/10.1007/978-1-4757-3532-1_5
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4419-5235-6
Online ISBN: 978-1-4757-3532-1
eBook Packages: Springer Book Archive