MIT15_053S13_rec07sol

MIT15_053S13_rec07sol - Optimization Methods in Management...

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

View Full Document Right Arrow Icon
Optimization Methods in Management Science MIT 15.053 Recitation 7 TAs: Giacomo Nannicini, Ebrahim Nasrabadi Problem 1 Suppose branch and bound is being applied to a 0–1 integer program in which we are maximizing. By node 11 the frst three variables have been fxed. An incumbent has already been Found (in another part oF the tree) and has value 15. ±urthermore, x 4 has been chosen to be the next variable to branch on. This situation is illustrated in the Following Fragment oF the branch and bound tree: 11 12 13 Incumbent: z = 15 z LP & 16 x 4 = 1 x 4 = 0 x 1 , x 2 , x 3 fixed ±igure 1: A Fragment oF the branch and bound tree For Problem 1. The LP relaxation solved at node 11 (which has x 4 and x 5 as Free variables) was: max 18 x 4 + ax 5 + 10 s.t. 8 x 4 + 10 x 5 5 , 0 x 4 1 , 0 x 5 1 , (Hint: ±or the Following questions, the LP relaxation essentially becomes a one variable problem that can be solved by inspection.) Part A.1 Suppose x 4 is set to 1. Does node 12 get pruned (Fathomed)? JustiFy your answer. Solution. Yes, node 12 gets Fathomed. IF x4 is set to 1, then the LP relaxation becomes:
Background image of page 1

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

View Full Document Right Arrow Icon
max ax 5 + 28 s.t. 10 x 5 ≤ − 3 , 0 x 5 1 , The relaxation is infeasible because of the Frst constraint, so node 12 gets fathomed. Part B.1 Suppose x 4 is set to 0 and parameter a = 12. Does node 13 get pruned (fathomed)? Justify your answer.
Background image of page 2
Image of page 3
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

Page1 / 5

MIT15_053S13_rec07sol - Optimization Methods in Management...

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

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