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.
KeywordsConvex Hull Mixed Integer Linear Programming Master Problem Valid Inequality Continuous Relaxation
Unable to display preview. Download preview PDF.