Lecture10 - Integer Programming IE418 Lecture 10 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 10 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 10 1 Reading for This Lecture Wolsey Chapter 7 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 10 2 Computational Integer Programming We now shift our focuse to how difficult classes of integer programs are solved in practice. Computationally, the most important aspect of solving integer programs is obtaining good bounds on the value of the optimal solution. In this lecture, we will motivate this fact by introducing the branch and bound algorithm. We will then look at various methods of obtaining bounds. Later, we will examine branch and bound in more detail.
Background image of page 3

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

View Full DocumentRight Arrow Icon
IE418 Lecture 10 3 Branch and Bound Branch and bound is the most commonly-used algorithm for solving MILPs. It is a divide and conquer approach. Suppose F is the feasible region for some MILP and we wish to solve max x F c ± x . Consider a partition of F into subsets F 1 , . . . F k . Then max x F c ± x = max { 1 i k } { max x F i c ± x } . In other words, we can optimize over each subset separately. Idea
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

Lecture10 - Integer Programming IE418 Lecture 10 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