Advertisement

Relaxation

Chapter
Part of the International Series in Operations Research & Management Science book series (ISOR, volume 170)

Abstract

The ideal problem relaxation is both easy to solve and in some sense tight, meaning that it closely resembles the original problem. The solution of a tight relaxation is more likely to be feasible in the original problem, or if not, to provide a good bound on the optimal value of the original problem.

Keywords

Convex Hull Mixed Integer Linear Programming Master Problem Valid Inequality Continuous Relaxation 
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, LLC 2012

Authors and Affiliations

  1. 1.Tepper School of BusinessCarnegie Mellon UniversityPittsburghUSA

Personalised recommendations