Lecture11 - Integer Programming IE418 Lecture 11 Dr Ted...

Info iconThis preview shows pages 1–5. Sign up to view the full content.

View Full Document Right Arrow Icon
Integer Programming IE418 Lecture 11 Dr. Ted Ralphs
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
IE418 Lecture 11 1 Reading for This Lecture Wolsey Chapter 2 Nemhauser and Wolsey Sections II.3.1, II.3.6, II.4.1, II.4.2, II.5.4
Background image of page 2
IE418 Lecture 11 2 Relaxation For simplicity, we now consider a pure integer program IP defined by z IP = max { cx | x S } , S = { x Z n + | Ax b } . Definition 1. A relaxation of IP is a maximization problem defined as z R = max { z R ( x ) | x S R } with the following two properties: S S R (1) cx z R ( x ) , x S. (2)
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
3 Importance of Relaxations The main purpose of a relaxation is to obtain an upper bound on z IP . Relaxation is used as a method of bounding in branch and bound. The idea is to choose a relaxation that is much easier to solve than the original problem. Note that the relaxation must be solved to optimality to yield a valid bound. We will consider three basic types of relaxations. LP relaxation
Background image of page 4
Image of page 5
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 08/06/2008 for the course IE 418 taught by Professor Ralphs during the Spring '08 term at Lehigh University .

Page1 / 10

Lecture11 - Integer Programming IE418 Lecture 11 Dr Ted...

This preview shows document pages 1 - 5. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online