Domain Reduction

  • Mohit Tawarmalani
  • Nikolaos V. Sahinidis
Part of the Nonconvex Optimization and Its Applications book series (NOIA, volume 65)


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.


Master Problem Dual Solution Range Reduction Optimal Dual Solution Dualizing Parameterization 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media Dordrecht 2002

Authors and Affiliations

  • Mohit Tawarmalani
    • 1
  • Nikolaos V. Sahinidis
    • 2
  1. 1.Purdue UniversityWest LafayetteUSA
  2. 2.University of IllinoisUrbanaUSA

Personalised recommendations