ps3 - Homework 3 IE418 Integer Programming Dr. Ralphs Due...

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

View Full Document Right Arrow Icon
Homework 3 IE418 – Integer Programming Dr. Ralphs Due March 13, 2007 1. Consider the 0-1 knapsack problem: max { n X j =1 c j x j | n X j =1 a j x j b, x B n } with a j , c j > 0 for j = 1 , . . . , n . (a) Show that if c 1 a 1 ≥ ··· ≥ c n a n > 0, r - 1 j =1 a j b and r j =1 a j > b , then the solution to the LP relaxation is x j = 1 for j = 1 , . . . , r - 1, x r = ( b - r - 1 j =1 a j ) /A r and x j = 0 for j > r . (b) Solve the instance max 17 x 1 + 10 x 2 + 25 x 3 + 17 x 4 5 x 1 + 3 x 2 + 8 x 3 + 7 x 4 12 x B 4 by branch and bound and show the result graphically. 2. Show that the stronger of the two formulation for the open pit mining problem from Homework 1 is ideal. 3. Consider an integer program max { cx | Ax b, 0 x u } Suppose the linear programming relaxation has been solved to optimality and row zero of the tableau looks like z = ¯ a 00 + X j NB 1 ¯ a 0 j x j + X j NB 2 ¯ a 0 j ( x j - u j ) where NB 1 are the nonbasic variables at 0 and
Background image of page 1

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

View Full DocumentRight Arrow Icon
Image of page 2
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 / 2

ps3 - Homework 3 IE418 Integer Programming Dr. Ralphs Due...

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

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